Multiprocesor Interconnection Networks
Dragoš Cvetković, Tatjana Davidović (2009)
Zbornik Radova
Similarity:
Dragoš Cvetković, Tatjana Davidović (2009)
Zbornik Radova
Similarity:
X. Shen, Y. Hou, I. Gutman, X. Hui (2010)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Simić, Slobodan K. (1989)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Amanda Niedzialomski (2016)
Discussiones Mathematicae Graph Theory
Similarity:
For k ∈ ℤ+ and G a simple, connected graph, a k-radio labeling f : V (G) → ℤ+ of G requires all pairs of distinct vertices u and v to satisfy |f(u) − f(v)| ≥ k + 1 − d(u, v). We consider k-radio labelings of G when k = diam(G). In this setting, f is injective; if f is also surjective onto {1, 2, . . . , |V (G)|}, then f is a consecutive radio labeling. Graphs that can be labeled with such a labeling are called radio graceful. In this paper, we give two results on the existence of radio...
Brandt, Stephan, Brinkmann, Gunnar, Harmuth, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Abdollahi, A., Vatandoost, E. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Petrović, Miroslav, Milekić, Bojana (2000)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Ying Liu (2013)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
Let G be a graph with n vertices and ν(G) be the matching number of G. The inertia of a graph G, In(G) = (n₊,n₋,n₀) is an integer triple specifying the numbers of positive, negative and zero eigenvalues of the adjacency matrix A(G), respectively. Let η(G) = n₀ denote the nullity of G (the multiplicity of the eigenvalue zero of G). It is well known that if G is a tree, then η(G) = n - 2ν(G). Guo et al. [Ji-Ming Guo, Weigen Yan and Yeong-Nan Yeh. On the nullity and the matching number...
Chandran, L.Sunil, Lozin, Vadim V., Subramanian, C.R. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Yi Wang, Yi-Zheng Fan, Xiao-Xin Li, Fei-Fei Zhang (2015)
Discussiones Mathematicae Graph Theory
Similarity:
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order n and size m in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size n/2 ). In this paper we discuss the minimizing graphs of a special class of graphs of order n whose complements are connected and...
Brouwer, A.E., Spence, E. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cvetković, D., Rowlinson, P. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Marián Klešč, Stefan Schrötter (2011)
Discussiones Mathematicae Graph Theory
Similarity:
Kulli and Muddebihal [V.R. Kulli, M.H. Muddebihal, Characterization of join graphs with crossing number zero, Far East J. Appl. Math. 5 (2001) 87-97] gave the characterization of all pairs of graphs which join product is planar graph. The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. There are only few results concerning crossing numbers of graphs obtained as join product of two graphs. In the paper, the exact values of crossing...
Terry A. McKee (2018)
Discussiones Mathematicae Graph Theory
Similarity:
Complete multipartite graphs range from complete graphs (with every partite set a singleton) to edgeless graphs (with a unique partite set). Requiring minimal separators to all induce one or the other of these extremes characterizes, respectively, the classical chordal graphs and the emergent unichord-free graphs. New theorems characterize several subclasses of the graphs whose minimal separators induce complete multipartite subgraphs, in particular the graphs that are 2-clique sums...
Zlatomir Lukić (1982)
Publications de l'Institut Mathématique
Similarity:
Dragoš Cvetković, Tatjana Davidović (2011)
Zbornik Radova
Similarity: