Signless Laplacians and line graphs

D. Cvetković

The search session has expired. Please query the service again.

Displaying similar documents to “Signless Laplacians and line graphs”

Cospectral Graphs With Least Eigenvalue at Least -2

Dragoš Cvetković, Mirko Lepović (2005)

Publications de l'Institut Mathématique

Similarity:

TOWARDS A SPECTRAL THEORY OF GRAPHS BASED ON THE SIGNLESS LAPLACIAN, I

Dragoš Cvetković, Slobodan K. Simić (2009)

Publications de l'Institut Mathématique

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

Some results on graphs with at most two positive eigenvalues.

Petrović, Miroslav (1991)

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

Similarity:

Radio Graceful Hamming Graphs

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

Hyperenergetic graphs and cyclomatic number

X. Shen, Y. Hou, I. Gutman, X. Hui (2010)

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

Similarity:

The Least Eigenvalue of Graphs whose Complements Are Uni- cyclic

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

Integral quartic Cayley graphs on Abelian groups.

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

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Eigenvalues and the max-cut problem

Bojan Mohar, Svatopluk Poljak (1990)

Czechoslovak Mathematical Journal

Similarity:

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:

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: