Results 1 to 10 of about 6,799 (133)
On the spectral radius and energy of signless Laplacian matrix of digraphs. [PDF]
Let D be a digraph of order n and with a arcs. The signless Laplacian matrix Q(D) of D is defined as Q(D)=Deg(D)+A(D), where A(D) is the adjacency matrix and Deg(D) is the diagonal matrix of vertex out-degrees of D.
Ganie HA, Shang Y.
europepmc +9 more sources
On Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy [PDF]
In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy graph.
Luis Medina, Hans Nina, Macarena Trigo
semanticscholar +6 more sources
Color signless Laplacian energy of graphs
In this paper, we introduce the new concept of color Signless Laplacian energy L E c + ( G ) . It depends on the underlying graph G and the colors of the vertices.
P. G. Bhat, S. D’souza
semanticscholar +5 more sources
Signless Laplacian energy aware decision making for electric car batteries based on intuitionistic fuzzy graphs. [PDF]
Fuzzy 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 +5 more sources
Seidel Signless Laplacian Energy of Graphs [PDF]
Let S(G) be the Seidel matrix of a graph G of order n and let DS(G)=diag(n-1-2d1, n-1-2d2,..., n-1-2dn) be the diagonal matrix with d_i denoting the degree of a vertex v_i in G.
H. Ramane +3 more
semanticscholar +3 more sources
Intuitionistic fuzzy approach based on correlation coefficient and signless Laplacian energy with applications. [PDF]
Decision-making in uncertain and complex environments requires methods that can effectively capture ambiguity in expert judgments. Traditional fuzzy graph models often overlook non-membership and hesitation degrees, limiting their descriptive power.
Atheeque AM, Basha SS.
europepmc +3 more sources
Bounds for the signless Laplacian energy
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
N. Abreu +4 more
semanticscholar +7 more sources
On the bounds for signless Laplacian energy of a graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hilal A. Ganie, S. Pirzada
semanticscholar +5 more sources
Bounds for the signless Laplacian energy of digraphs
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
semanticscholar +6 more sources
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 +5 more sources

