Displaying similar documents to “Controllable graphs”

The inertia of unicyclic graphs and bicyclic graphs

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...

Equienergetic graphs

Harishchandra S. Ramane, Hanumappa B. Walikar, Siddani Bhaskara Rao, B. Devadas Acharya, Prabhakar R. Hampiholi, Sudhir R. Jog, Ivan Gutman (2004)

Kragujevac Journal of Mathematics

Similarity: