Results 21 to 30 of about 6,799 (133)
On two energy-like invariants of line graphs and related graph operations [PDF]
Journal of Inequalities and Applications, 2016 For a simple graph G of order n, let μ 1 ≥ μ 2 ≥ ⋯ ≥ μ n = 0 $\mu_{1}\geq\mu_{2}\geq\cdots\geq\mu_{n}=0$ be its Laplacian eigenvalues, and let q 1 ≥ q 2 ≥ ⋯ ≥ q n ≥ 0 $q_{1}\geq q_{2}\geq\cdots\geq q_{n}\geq0$ be its signless Laplacian eigenvalues.
Xiaodan Chen, Yaoping Hou, Jingjian Li
core +3 more sources
Signless Laplacian energy of a first KCD matrix
Acta Universitatis Sapientiae, Informatica, 2022 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.
K. G. Mirajkar, A. Morajkar
semanticscholar +3 more sources
The Laplacian and signless Laplacian energy of a graph under perturbation [PDF]
AIP Conference Proceedings, 2020 In this paper, we find energy, Laplacian energy and signless Laplacian energy of a complete graph when perturbed by adding some vertices and edges.
E. Nandakumar, R. Venkatesan, A. Yasmin
semanticscholar +2 more sources
On distance signless Laplacian spectrum and energy of graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2018 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 DQ(G) = Tr(G) + D(G), where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz +2 more
doaj +2 more sources
Merging the Spectral Theories of Distance Estrada and Distance Signless Laplacian Estrada Indices of Graphs [PDF]
Mathematics, 2019 Suppose that G is a simple undirected connected graph. Denote by D(G) the distance matrix of G and by Tr(G) the diagonal matrix of the vertex transmissions in G, and let α∈[0,1] . The generalized distance matrix Dα(G) is defined as Dα(G)=αTr(G)+(1−α)D(G)
Alhevaz, Abdollah +2 more
core +3 more sources
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs
Journal of Mathematics, 2016 Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
doaj +2 more sources
On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs
Discrete Applied Mathematics, 2017 Let G be a graph of order n . The energy E ( G ) of a simple graph G is the sum of absolute values of the eigenvalues of its adjacency matrix. The Laplacian energy, the signless Laplacian energy and the distance energy of graph G are denoted by L E ( G )
K. Das, M. Aouchiche, P. Hansen
semanticscholar +3 more sources
On Some Aspects of the Generalized Petersen Graph [PDF]
Electronic Journal of Graph Theory and Applications, 2017 Let $p \ge 3$ be a positive integer and let $k \in {1, 2, ..., p-1} \ \lfloor p/2 \rfloor$. The generalized Petersen graph GP(p,k) has its vertex and edge set as $V(GP(p, k)) = \{u_i : i \in Zp\} \cup \{u_i^\prime : i \in Z_p\}$ and $E(GP(p, k)) = \{u_i ...
Yegnanarayanan, V. (V)
core +4 more sources
The minimum covering signless laplacian energy of graph
Journal of Physics: Conference Series, 2020 Gutman [5]has come out with the idea of graph energy as summation of numerical value of latent roots of the adjacency matrix of the given graph Γ. In this paper, we introduce the Minumum Covering Signless Laplacian energy LC+E(Γ) of a graph Γ and obtain ...
K. Permi, H. Manasa, M. Geetha
semanticscholar +2 more sources
Maximality of the signless Laplacian energy
Discrete Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L. K. Pinheiro, V. Trevisan
semanticscholar +3 more sources