Results 21 to 30 of about 222 (137)
On the construction of L-equienergetic graphs
AKCE International Journal of Graphs and Combinatorics, 2015 For a graph G with n vertices and m edges, and having Laplacian spectrum μ1,μ2,…,μn and signless Laplacian spectrum μ1+,μ2+,…,μn+, the Laplacian energy and signless Laplacian energy of G are respectively, defined as LE(G)=∑i=1n|μi−2mn| and LE+(G)=∑i=1n ...
S. Pirzada, Hilal A. Ganie
doaj +2 more sources
Bounds for the signless Laplacian energy of digraphs
Indian Journal of Pure and Applied Mathematics, 2017 The paper under review gives upper and lower bounds for the signless Laplacian energy of finite directed graphs without loops and multiple arcs but perhaps with a pair of oppositely directed arcs joining the same pair of vertices. The signless Laplacian is defined to be \(Q=D+A,\) where \(D\) is the diagonal matrix with outdegrees of vertices along the
Weige Xi, Ligong Wang, Wang Ligong
exaly +3 more sources
Signless Laplacian energy aware decision making for electric car batteries based on intuitionistic fuzzy graphs. [PDF]
Sci ProgFuzzy graphs (FGs) contain dual-nature characteristics that may be extended to intuitionistic fuzzy graphs. These FGs are better at capturing ambiguity in situations in reality involving decision-making than FGs. In this paper, we address decision-making
Mohamed Atheeque A, Sharief Basha S.
europepmc +2 more sources
On Laplacian-energy-like invariant and incidence energy [PDF]
International Journal of Group Theory, 2015 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 +1 more source
Ain Shams Engineering JournalIn this study, we define the structure formation of the annihilator monic prime graph of commutative rings, whose distinct vertices X and J satisfies a condition annXJ≠annX⋃ann(J), graph is denoted by AMPG(Zn[x]/〈fx〉).
R. Sarathy, J. Ravi Sankar
doaj +3 more sources
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 +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 +2 more sources
Some improved bounds on two energy-like invariants of some derived graphs
Open Mathematics, 2019 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 +2 more sources
Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs
Le Matematiche, 2019 Summary: In this paper, we study the eigenvalues of the reciprocal distance signless Laplacian matrix of a connected graph and obtain some bounds for the maximum eigenvalue of this matrix. We also focus on bipartite graphs and find some bounds for the spectral radius of the reciprocal distance signless Laplacian matrix of this class of graphs. Moreover,
A. Alhevaz, M. Baghipur, H.S. Ramane
openaire +3 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 +2 more sources