Results 41 to 50 of about 110,880 (163)
Some Chemistry Indices of Clique‐Inserted Graph of a Strongly Regular Graph
In this paper, we give the relation between the spectrum of strongly regular graph and its clique‐inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique‐inserted graph of strongly regular graph are calculated. We also give formulae expressing the energy, Kirchoff index, and the number of spanning trees of clique‐inserted ...
Chun-Li Kan +4 more
wiley +1 more source
Eigenvalue Bounds for the Signless $p$-Laplacian
We consider the signless $p$-Laplacian $Q_p$ of a graph, a generalisation of the quadratic form of the signless Laplacian matrix (the case $p=2$). In analogy to Rayleigh's principle the minimum and maximum of $Q_p$ on the $p$-norm unit sphere are called its smallest and largest eigenvalues, respectively.
Elizandro Max Borba, Uwe Schwerdtfeger
openaire +4 more sources
Note on a conjecture for the sum of signless Laplacian eigenvalues [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Xiaodan +3 more
openaire +2 more sources
The maximum clique and the signless Laplacian eigenvalues [PDF]
summary:Lower and upper bounds are obtained for the clique number $\omega (G)$ and the independence number $\alpha (G)$, in terms of the eigenvalues of the signless Laplacian matrix of a graph $G$
Liu, BoLian +3 more
core +1 more source
Signless Laplacian eigenvalues and circumference of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianfeng Wang 0002, Francesco Belardo
openaire +5 more sources
A note on the signless Laplacian eigenvalues of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
WANG JF, BELARDO, FRANCESCO
openaire +3 more sources
Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue [PDF]
Let $G$ be a connected $m$-uniform hypergraph. In this paper we mainly consider the eigenvectors of the Laplacian or signless Laplacian tensor of $G$ associated with zero eigenvalue, called the first Laplacian or signless Laplacian eigenvectors of $G$. By means of the incidence matrix of $G$, the number of first Laplacian or signless Laplaican (H- or N-
Yi-Zheng Fan +5 more
openaire +2 more sources
An interlacing property of the signless Laplacian of threshold graphs [PDF]
We show that for threshold graphs, the eigenvalues of the signless Laplacian matrix interlace with the degrees of the vertices. As an application, we show that the signless Brouwer conjecture holds for threshold graphs, i.e., for threshold graphs the sum
Torres, Guilherme +3 more
core +1 more source
Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph
Using the notions of clique partitions and edge clique covers of graphs, we consider the corresponding incidence structures. This connection furnishes lower bounds on the negative eigenvalues and their multiplicities associated with the adjacency matrix,
Shaun Fallat, Seyed Ahmad Mojallal
doaj +1 more source
A Note on Some Bounds of the α‐Estrada Index of Graphs
Let G be a simple graph with n vertices. Let A~αG=αDG+1−αAG, where 0 ≤ α ≤ 1 and A(G) and D(G) denote the adjacency matrix and degree matrix of G, respectively. EEαG=∑i=1neλi is called the α‐Estrada index of G, where λ1, ⋯, λn denote the eigenvalues of A~αG. In this paper, the upper and lower bounds for EEα(G) are given.
Yang Yang +3 more
wiley +1 more source

