Multiprocessor Interconnection Networks
Dragoš Cvetković, Tatjana Davidović (2011)
Zbornik Radova
Similarity:
Dragoš Cvetković, Tatjana Davidović (2011)
Zbornik Radova
Similarity:
Petrović, Miroslav M. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Ivan Gutman (2011)
Zbornik Radova
Similarity:
X. Shen, Y. Hou, I. Gutman, X. Hui (2010)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
H. S. Ramane, D. S. Revankar, I. Gutman, H. B. Walikar (2009)
Publications de l'Institut Mathématique
Similarity:
Petrović, Miroslav, Milekić, Bojana (2000)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Dragoš Cvetković, Tatjana Davidović (2008)
The Yugoslav Journal of Operations Research
Similarity:
Jaroslav Ivanco (2007)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (and consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we prove that any balanced bipartite graph with minimum degree greater than |V(G)|/4 ≥ 2 is magic. A similar result is presented for supermagic regular bipartite graphs.
Simic, Slobodan K. (1981)
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...
Yan Yang, Yichao Chen (2017)
Discussiones Mathematicae Graph Theory
Similarity:
The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been known for only few graphs. We obtain the thickness of vertex-amalgamation and bar-amalgamation of graphs, the lower and upper bounds for the thickness of edge-amalgamation and 2-vertex-amalgamation of graphs, respectively. We also study...
Abdollahi, A., Vatandoost, E. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gutman, I. (1996)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Brandt, Stephan, Brinkmann, Gunnar, Harmuth, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gliviak, Ferdinand, Kyš, P. (1997)
Acta Mathematica Universitatis Comenianae. New Series
Similarity: