Non-complete extended -sum of graphs, graph angles and star partitions.

Cvetković, Dragoš; Simić, Slobodan

Displaying similar documents to “Non-complete extended $P$ -sum of graphs, graph angles and star partitions.”

Discussing graph theory with a computer. II: Theorems suggested by the computer.

Cvetkovic, Dragos M. (1983)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

Some results on graphs with at most two positive eigenvalues.

Petrović, Miroslav (1991)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

Signless Laplacians and line graphs

D. Cvetković (2005)

Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques

Similarity:

On the numbers of positive and negative eigenvalues of a graph.

Torgašev, Aleksandar (1992)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

Integral quartic Cayley graphs on Abelian groups.

Abdollahi, A., Vatandoost, E. (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

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