Results 51 to 60 of about 6,081 (145)
Signless Laplacian energy of a graph and energy of a line graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hilal A. Ganie +2 more
semanticscholar +3 more sources
Relation between signless Laplacian energy, energy of graph and its line graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K. Das, S. A. Mojallal
semanticscholar +2 more sources
:Introduction: Group decision-making shows a critical job while designating with dynamic issues of quick development of society. Decision make is the manner about discovering the beneficial option among the possible alternatives.
Obbu Ramesh
openalex +3 more sources
On the Signless Laplacian ABC-Spectral Properties of a Graph
In the paper, we introduce the signless Laplacian ABC-matrix Q̃(G)=D¯(G)+Ã(G), where D¯(G) is the diagonal matrix of ABC-degrees and Ã(G) is the ABC-matrix of G. The eigenvalues of the matrix Q̃(G) are the signless Laplacian ABC-eigenvalues of G.
Bilal A. Rather +2 more
doaj +2 more sources
Intuitionistic fuzzy approach based on correlation coefficient and signless Laplacian energy with applications [PDF]
A. Mohamed Atheeque, S. Sharief Basha
openalex +2 more sources
Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs
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,
Abdollah Alhevaz +2 more
openalex +3 more sources
Novel Concept of Energy in Bipolar Single-Valued Neutrosophic Graphs with Applications
The energy of a graph is defined as the sum of the absolute values of its eigenvalues. Recently, there has been a lot of interest in graph energy research.
Siti Nurul Fitriah Mohamad +3 more
doaj +1 more source
New Bounds for the Generalized Distance Spectral Radius/Energy of Graphs
Let G be a simple connected graph with vertex set V(G) = {v1, v2, …, vn} and dvi be the degree of the vertex vi. Let D(G) be the distance matrix and Tr(G) be the diagonal matrix of the vertex transmissions of G. The generalized distance matrix of G is defined as Dα(G) = αTr(G) + (1 − α)D(G), where 0 ≤ α ≤ 1. If λ1, λ2, …, λn are the eigenvalues of Dα(G)
Yuzheng Ma +3 more
wiley +1 more source
On Laplacian Equienergetic Signed Graphs
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal. In this paper, we present several infinite families of Laplacian equienergetic signed graphs.
Qingyun Tao, Lixin Tao, Yongqiang Fu
wiley +1 more source
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
A connected graph is called Hamilton‐connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether a graph is Hamilton‐connected is an NP‐complete problem. Hamiltonian and Hamilton‐connected graphs have diverse applications in computer science and electrical engineering.
Sakander Hayat +4 more
wiley +1 more source

