Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
Let X be a partitioned matrix and let B its equitable quotient matrix. Consider a simple, undirected, connected graph G of order n. In this paper, we employ a technique based on quotient matrices derived from block-partitioned structures to establish new
Luis Medina +2 more
doaj +2 more sources
On the signless Laplacian and normalized signless Laplacian spreads of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emina Milovanović +3 more
openalex +3 more sources
Dual Cheeger Constants, Signless 1-Laplacians and Maxcut [PDF]
Accepted by SCIENCE CHINA Mathematics on January 13 ...
Sihong Shao, Chuan Yang, Dong Zhang
openalex +3 more sources
Nordhaus-Gaddum Type Inequalities for Laplacian and Signless Laplacian Eigenvalues [PDF]
Let $G$ be a graph with $n$ vertices. We denote the largest signless Laplacian eigenvalue of $G$ by $q_1(G)$ and Laplacian eigenvalues of $G$ by $\mu_1(G)\ge\cdots\ge\mu_{n-1}(G)\ge\mu_n(G)=0$. It is a conjecture on Laplacian spread of graphs that $\mu_1(G)-\mu_{n-1}(G)\le n-1$ or equivalently $\mu_1(G)+\mu_1(\overline G)\le2n-1$.
Firouzeh Ashraf, B. Tayfeh‐Rezaie
+7 more sources
Signless Laplacian energy, distance Laplacian energy and distance signless Laplacian spectrum of unitary addition Cayley graphs [PDF]
In this paper we compute bounds for signless Laplacian energy, distance signless Laplacian eigenvalues and signless Laplacian energy of unitary addition Cayley graph G_{n}. We also obtain distance Laplacian eigenvalues and distance Laplacian energy of G_{n}.
P., Naveen, A. V, Chithra
openaire +2 more sources
Graphs determined by signless Laplacian spectra [PDF]
Accepted in AKCE International Journal of Graphs and Combinatorics(To appear). arXiv preprint arXiv:1803.06135 has been accepted in Carpathian Mathematical Publications.
Ali Zeydi Abdian +2 more
openalex +5 more sources
NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS [PDF]
The distance signless Laplacian spectral radius of a connected graph $G$ is the largest eigenvalue of the distance signless Laplacian matrix of $G$, defined as $D^{Q}(G)=Tr(G)+D(G)$, where $D(G)$ is the distance matrix of $G$ and $Tr(G)$ is the diagonal ...
A. Alhevaz, M. Baghipur, S. Paul
doaj +1 more source
Chromatic number and signless Laplacian spectral radius of graphs [PDF]
For any simple graph $G$, the signless Laplacian matrix of $G$ is defined as $D(G)+A(G)$, where $D(G)$ and $A(G)$ are the diagonal matrix of vertex degrees and the adjacency matrix of $G$, respectively.
Mohammad Reza Oboudi
doaj +1 more source
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
The permanent of an n × n matrix [Formula: see text] is defined as [Formula: see text] where the sum is taken over all permutations σ of [Formula: see text] The permanental polynomial of M, denoted by [Formula: see text] is [Formula: see text] where In ...
Aqib Khan +2 more
doaj +1 more source
Signless normalized Laplacian for hypergraphs
The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the normalized Laplacian for bipartite chemical hypergraphs.
Eleonora Andreotti, Raffaella Mulas
openaire +4 more sources

