Signless Laplacians and line graphs
D. Cvetković (2005)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
D. Cvetković (2005)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Dragoš Cvetković, Mirko Lepović (2005)
Publications de l'Institut Mathématique
Similarity:
D. Cvetković (2008)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Dragoš Cvetković (2012)
The Yugoslav Journal of Operations Research
Similarity:
Lihua Feng, Guihai Yu (2009)
Publications de l'Institut Mathématique
Similarity:
Harishchandra S. Ramane, Ivan Gutman (2010)
Kragujevac Journal of Mathematics
Similarity:
Bojan Mohar, Svatopluk Poljak (1990)
Czechoslovak Mathematical Journal
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...
Cvetković, D., Rowlinson, P. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Cvetkovic, Dragos M. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Torgašev, Aleksandar (1992)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: