Results 121 to 130 of about 42,138 (164)
Some improved bounds on two energy-like invariants of some derived graphs
Given a simple graph G, its Laplacian-energy-like invariant LEL(G) and incidence energy IE(G) are the sum of square root of its all Laplacian eigenvalues and signless Laplacian eigenvalues, respectively. This paper obtains some improved bounds on LEL and
Cui Shu-Yu, Tian Gui-Xian
doaj +1 more source
What is a proper graph Laplacian? An operator-theoretic framework for graph diffusion
We introduce an operator-theoretic definition of a proper graph Laplacian as any matrix associated with a given graph that can be expressed as the composition of a divergence and a gradient operator, with the gradient acting between graph-related spaces ...
Estrada Ernesto
doaj +1 more source
On Laplacian-energy-like invariant and incidence energy [PDF]
For a simple connected graph G with n -vertices having Laplacian eigenvalues μ 1 , μ 2 , … , μ n−1 , μ n =0 , and signless Laplacian eigenvalues q 1 ,q 2 ,…,q n , the Laplacian-energy-like invariant(LEL ) and the incidence energy ...
Shariefuddin Pirzada , Hilal A. Ganie
doaj
Bounds for the signless laplacian energy
The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. The Laplacian (respectively, the signless Laplacian) energy of G is the sum of the absolute values of the differences between the eigenvalues of ...
Gutman, I. +4 more
core
On comparison between the distance energies of a connected graph
Let G be a simple connected graph of order n having Wiener index W(G). The distance, distance Laplacian and the distance signless Laplacian energies of G are respectively defined asDE(G)=∑i=1n|υiD|,DLE(G)=∑i=1n|υiL−Tr‾|andDSLE(G)=∑i=1n|υiQ−Tr‾|, where ...
Hilal A. Ganie +2 more
doaj +1 more source
This research investigates the relationship between algebra and graph theory, specifically how algebra facilitates graph theory. Associating matrices with graphs introduces the concept of graph energies.
Abdurahim, Abdurahim +5 more
core +1 more source
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 +1 more source
Graphs with maximal signless Laplacian spectral radius
By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G),D(G) denote respectively the adjacency matrix and the diagonal matrix of vertex degrees of G.
Chang, Ting-Jung; Tam, Bit-Shun +1 more
core +1 more source
Spektrum adjacency, laplace, signless laplace, dan detour graf subgrup dan komplemen graf subgrupdari grup dihedral [PDF]
INDONESIA: Penelitian ini membahas pola umum spektrum adjacency, Laplace, signless Laplace, dan detour dari graf subgrup dan komplemen graf subgrup 〈r^2 〉 dari grup dihedral D_2n.
Akhadiyah, Dinda Akromatul
core
Spectra, signless Laplacian and Laplacian spectra of complementary prisms of graphs [PDF]
The complementary prism GG‾ of a graph G is obtained from the disjoint union of G and its complement G‾ by adding an edge for each pair of vertices (v,v′), where v is in G and its copy v′ is in G‾.
Freitas, Maria Aguieiras A. de +3 more
core +1 more source

