Results 41 to 50 of about 222 (137)
On the signless Laplacian and normalized signless Laplacian spreads of graphs
summary:Let $G=(V,E)$, $V=\{v_1,v_2,\ldots ,v_n\}$, be a simple connected graph with $n$ vertices, $m$ edges and a sequence of vertex degrees $d_1\geq d_2\geq \cdots \geq d_n$.
Milovanović, Emina +3 more
core +1 more source
A graph is said to be borderenergetic (-borderenergetic, respectively) if its energy (Laplacian energy, respectively) equals the energy (Laplacian energy, respectively) of the complete graph .
Qingyun Tao, Yaoping Hou
doaj +1 more source
Laplacian and signless laplacian spectra and energies of multi-step wheels
<abstract> <p>Energies and spectrum of graphs associated to different linear operators play a significant role in molecular chemistry, polymerisation, pharmacy, computer networking and communication systems. In current article, we compute closed forms of signless Laplacian and Laplacian spectra and energies of multi-step wheel networks < ...
Zheng-Qing Chu +4 more
openaire +4 more sources
On maximum degree (signless) Laplacian matrix of a graph
Let G be a simple graph on n vertices and v1, v2, . . . , vn be the vertices ofG. We denote the degree of a vertex vi in G by dG(vi) = di. The maximumdegree matrix of G, denoted by M(G), is the real symmetric matrix withits ijth entry equal to max{di, dj}
Raghu, V. D. +2 more
core +1 more source
Signless Laplacian energy of a first KCD matrix
Abstract The concept of first KCD signless Laplacian energy is initiated in this article. Moreover, we determine first KCD signless Laplacian spectrum and first KCD signless Laplacian energy for some class of graphs and their complement.
Mirajkar Keerthi G., Morajkar Akshata
openaire +2 more sources
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
Construction for the Sequences of Q‐Borderenergetic Graphs
This research intends to construct a signless Laplacian spectrum of the complement of any k‐regular graph G with order n. Through application of the join of two arbitrary graphs, a new class of Q‐borderenergetic graphs is determined with proof. As indicated in the research, with a regular Q‐borderenergetic graph, sequences of regular Q‐borderenergetic ...
Bo Deng +4 more
wiley +1 more source
Bounds on the α‐Distance Energy and α‐Distance Estrada Index of Graphs
Let G be a simple undirected connected graph, then Dα(G) = αTr(G) + (1 − α)D(G) is called the α‐distance matrix of G, where α ∈ [0,1], D(G) is the distance matrix of G, and Tr(G) is the vertex transmission diagonal matrix of G. In this paper, we study some bounds on the α‐distance energy and α‐distance Estrada index of G.
Yang Yang +3 more
wiley +1 more source
Note on the Sum of Powers of Normalized Signless Laplacian Eigenvalues of Graphs [PDF]
In this paper, for a connected graph G and a real α≠0, we define a new graph invariant σα(G)-as the sum of the alphath powers of the normalized signless Laplacian eigenvalues of G.
Ş. Burcu Bozkurt Altındağ
doaj +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

