Results 81 to 90 of about 110,880 (163)

On the Aα-Spectral Radii of Cactus Graphs

open access: yesMathematics, 2020
Let A ( G ) be the adjacent matrix and D ( G ) the diagonal matrix of the degrees of a graph G, respectively. For 0 ≤ α ≤ 1 , the A α -matrix is the general adjacency and signless Laplacian spectral matrix having the form of
Chunxiang Wang   +3 more
doaj   +1 more source

On the signless Laplacian eigenvalues related to independence number of graphs [PDF]

open access: yes, 2016
In this topic, we investigate the eigenvalues of signless Laplacian matrix of a connected graph with given independence number, and determined the graph which has the minimum. least signless Laplacian eigenvalue among all non-bipartite graphs.
Liu, Huiqing
core  

On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph [PDF]

open access: yes, 2010
summary:The Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph are the characteristic polynomials of its Laplacian matrix, signless Laplacian matrix and normalized Laplacian matrix, respectively.
Li, Jianxi   +3 more
core   +1 more source

Some results on the signless Laplacians of graphs

open access: yes, 2010
In this paper we give two results concerning the signless Laplacian spectra of simple graphs. Firstly, we give a combinatorial expression for the fourth coefficient of the (signless Laplacian) characteristic polynomial of a graph.
AN XH   +3 more
core   +1 more source

Notes on the sum of powers of the signless Laplacian eigenvalues of graphs

open access: yesArs Comb., 2013
For a graph $G$ and a non-zero real number $α$, the graph invariant $S_α(G)$ is the sum of the $α^{th}$ power of the non-zero signless Laplacian eigenvalues of $G$. In this paper, we obtain the sharp bounds of $S_α(G)$ for a connected bipartite graph $G$ on $n$ vertices and a connected graph $G$ on $n$ vertices having a connectivity less than or equal ...
Lihua You, Jieshan Yang
openaire   +3 more sources

Universal Adjacency Matrices with Two Eigenvalues [PDF]

open access: yes
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Omidi, G.R., Haemers, W.H.
core  

On conjectures involving second largest signless Laplacian eigenvalue of graphs

open access: yes, 2010
Let G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then the Laplacian matrix of G is L(G)=D(G)-A(G) and the signless Laplacian matrix of G is Q(G)=D(G)+A(G). In this paper we obtain a
Das, Kinkar Ch.
core   +1 more source

On the Spectral Characterization of Prime Coprime Graphs Associated with Dihedral Groups

open access: yesScience and Technology Indonesia
Spectral graph theory and group theory help reveal how the structure of graphs shapes their mathematical properties. This research aims to analyze the spectral descriptors of the prime coprime graph of a dihedral group associated with the Laplacian ...
Mamika Ujianita Romdhini   +6 more
doaj   +1 more source

H+-EIGENVALUES OF LAPLACIAN AND SIGNLESS LAPLACIAN TENSORS

open access: yes, 2014
We propose a simple and natural definition for the Laplacian and the signless Lapla-cian tensors of a uniform hypergraph. We study their H+-eigenvalues, i.e., H-eigenvalues with non-negative H-eigenvectors, and H++-eigenvalues, i.e., H-eigenvalues with ...
Liqun Qi
core  

On Zagreb index, signless Laplacian eigenvalues and signless Laplacian energy of a graph

open access: yes, 2022
Let $G$ be a simple graph with order $n$ and size $m$. The quantity $M_1(G)=\displaystyle\sum_{i=1}^{n}d^2_{v_i}$ is called the first Zagreb index of $G$, where $d_{v_i}$ is the degree of vertex $v_i$, for all $i=1,2,\dots,n$.
Pirzada, S., Khan, Saleem
core  

Home - About - Disclaimer - Privacy