Results 31 to 40 of about 6,081 (145)
Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph
Complexity, 2021 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.
Chun-Li Kan +3 more
doaj +2 more sources
Sharp Bounds on (Generalized) Distance Energy of Graphs [PDF]
Mathematics, 2020 Given a simple connected graph G, let D ( G ) be the distance matrix, D L ( G ) be the distance Laplacian matrix, D Q ( G ) be the distance signless Laplacian matrix, and T r ( G ) be the vertex transmission ...
Abdollah Alhevaz +3 more
doaj +3 more sources
On the signless Laplacian energy and signless Laplacian Estrada index of extremal graphs
Applied Mathematical Sciences, 2014 R. Binthiya, P. B. Sarasija
semanticscholar +3 more sources
Minimum dominating signless laplacian graph energy
Journal of Physics: Conference Series, 2020 Abstract Minimum dominating graph energy was proposed by Rajesh Kanna et al.[11] in 2013. I propose the Minumum dominating signless laplacian graph energy L D
Kavita S Permi
openalex +2 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 ...
V. Yegnanarayanan
doaj +3 more sources
On the signless Laplacian energy of a digraph
Indian Journal of Pure and Applied Mathematics, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
H. A. Ganie
semanticscholar +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
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 T r ( G ) the diagonal matrix of the vertex transmissions in G, and let α ∈ [ 0 , 1 ] .
Abdollah Alhevaz +2 more
doaj +3 more sources
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
doaj +2 more sources
Some new bounds for the signless Laplacian energy of a graph [PDF]
, 2020 For a simple graph $G$ with $n$ vertices, $m$ edges and signless Laplacian eigenvalues $q_{1} \geq q_{2} \geq \cdots \geq q_{n} \geq 0$, its the signless Laplacian energy $QE(G)$ is defined as $QE(G) = \sum_{i=1}^{n}|q_{i} - \bar{d} |$, where $\bar{d} = \frac{2m}{n}$ is the average vertex degree of $G$.
Peng Wang, Qiongxiang Huang
openalex +3 more sources