Results 61 to 70 of about 6,799 (133)
Energy, Laplacian energy of double graphs and new families of equienergetic graphs [PDF]
, 2014 For a graph G with vertex set V(G) = {v1, v2, . . . , vn}, the extended double cover G* is a bipartite graph with bipartition (X, Y), X = {x1, x2, . . . , xn} and Y = {y1, y2, . . . , yn}, where two vertices xi and yj are adjacent if and only if i = j or
Ganie, Hilal A. +2 more
core +1 more source
On Generalized Distance Gaussian Estrada Index of Graphs [PDF]
, 2019 For a simple undirected connected graph G of order n, let D(G) , DL(G) , DQ(G) and Tr(G) be, respectively, the distance matrix, the distance Laplacian matrix, the distance signless Laplacian matrix and the diagonal matrix of the vertex transmissions of G.
Alhevaz, Abdollah +2 more
core +1 more source
Copies of a rooted weighted graph attached to an arbitrary weighted graph and applications [PDF]
, 2013 The spectrum of the Laplacian, signless Laplacian and adjacency matrices of the family of the weighted graphs R{H}, obtained from a connected weighted graph R on r vertices and r copies of a modified Bethe tree H by identifying the root of the i-th ...
Cardoso, Domingos M. +3 more
core +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
openaire +1 more source
On the Generalized Distance Energy of Graphs [PDF]
, 2019 The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 - α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions.
Alhevaz, Abdollah +3 more
core +1 more source
Certain Notions of Energy in Single-Valued Neutrosophic Graphs
Axioms, 2018 A single-valued neutrosophic set is an instance of a neutrosophic set, which provides us an additional possibility to represent uncertainty, imprecise, incomplete and inconsistent information existing in real situations.
Sumera Naz +2 more
doaj +1 more source
New upper bounds for the energy and signless Laplacian energy of a graph [PDF]
International Journal of Advances in Applied Mathematics and Mechanics, 2015 Rao Li
doaj +1 more source
On the Boundary of Incidence Energy and Its Extremum Structure of Tricycle Graphs
Frontiers in Physics, 2020 With the wide application of graph theory in circuit layout, signal flow chart and power system, more and more attention has been paid to the network topology analysis method of graph theory.
Hongyan Lu, Zhongxun Zhu
doaj +1 more source
The skew energy of random oriented graphs [PDF]
, 2013 Given a graph $G$, let $G^\sigma$ be an oriented graph of $G$ with the orientation $\sigma$ and skew-adjacency matrix $S(G^\sigma)$. The skew energy of the oriented graph $G^\sigma$, denoted by $\mathcal{E}_S(G^\sigma)$, is defined as the sum of the ...
Chen, Xiaolin +2 more
core +1 more source
Resistance Distance and Kirchhoff Index for a Class of Graphs
Mathematical Problems in Engineering, Volume 2018, Issue 1, 2018., 2018 Let G[F, Vk, Hv] be the graph with k pockets, where F is a simple graph of order n ≥ 1, Vk = {v1, v2, …, vk} is a subset of the vertex set of F, Hv is a simple graph of order m ≥ 2, and v is a specified vertex of Hv. Also let G[F, Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek = {e1, e2, …ek} is a subset of the ...
WanJun Yin +3 more
wiley +1 more source