Results 11 to 20 of about 1,262 (144)

The Characterizing Properties of (Signless) Laplacian Permanental Polynomials of Almost Complete Graphs

Journal of Mathematics, 2021
Let G be a graph with n vertices, and let LG and QG denote the Laplacian matrix and signless Laplacian matrix, respectively. The Laplacian (respectively, signless Laplacian) permanental polynomial of G is defined as the permanent of the characteristic ...
Tingzeng Wu, Tian Zhou
doaj   +2 more sources

Investigating Signless Laplacian Spectra and Network Topology in Helical Phenylene-Quadrilateral Structures

Journal of Mathematics
This study investigates the spectral and topological properties of rounded knot networks K2n, a helical extension of phenylene quadrilateral structures, through signless Laplacian spectral analysis.
Fareeha Hanif, Ali Raza, Md. Shajib Ali
doaj   +2 more sources

Principal eigenvector of the signless Laplacian matrix [PDF]

Computational and Applied Mathematics, 2021
In this paper, we study the entries of the principal eigenvector of the signless Laplacian matrix of a hypergraph. More precisely, we obtain bounds for this entries. These bounds are computed trough other important parameters, such as spectral radius, maximum and minimum degree.
openaire   +2 more sources

A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials

AKCE International Journal of Graphs and Combinatorics, 2023
The permanent of an n × n matrix [Formula: see text] is defined as [Formula: see text] where the sum is taken over all permutations σ of [Formula: see text] The permanental polynomial of M, denoted by [Formula: see text] is [Formula: see text] where In ...
Aqib Khan, Pratima Panigrahi, Swarup Kumar Panda   +2 more
doaj   +1 more source

Signless Laplacian energy of a first KCD matrix

Acta Universitatis Sapientiae, Informatica, 2022
Abstract The concept of first KCD signless Laplacian energy is initiated in this article. Moreover, we determine first KCD signless Laplacian spectrum and first KCD signless Laplacian energy for some class of graphs and their complement.
Mirajkar Keerthi G., Morajkar Akshata
openaire   +2 more sources

An analog of Matrix Tree Theorem for signless Laplacians [PDF]

Linear Algebra and its Applications, 2019
A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We show a similar combinatorial interpretation for principal minors of signless Laplacian $Q$.
Keivan Hassani Monfared, Sudipta Mallik
openaire   +3 more sources

(Generalized) Incidence and Laplacian‐Like Energies

Journal of Mathematics, Volume 2023, Issue 1, 2023., 2023
In this study, for graph Γ with r connected components (also for connected nonbipartite and connected bipartite graphs) and a real number ε(≠0,1), we found generalized and improved bounds for the sum of ε‐th powers of Laplacian and signless Laplacian eigenvalues of Γ.
A. Dilek Maden, Mohammad Tariq Rahim, Mohammad W. Alomari   +2 more
wiley   +1 more source

Two Kinds of Laplacian Spectra and Degree Kirchhoff Index of the Weighted Corona Networks

Journal of Mathematics, Volume 2022, Issue 1, 2022., 2022
Recently, the study related to network has aroused wide attention of the scientific community. Many problems can be usefully represented by corona graphs or networks. Meanwhile, the weight is a vital factor in characterizing some properties of real networks.
Haiqin Liu, Yanling Shao, Azhar Hussain
wiley   +1 more source

On maximum degree (signless) Laplacian matrix of a graph

Proyecciones (Antofagasta), 2022
Let G be a simple graph on n vertices and v1, v2, . . . , vn be the vertices ofG. We denote the degree of a vertex vi in G by dG(vi) = di. The maximumdegree matrix of G, denoted by M(G), is the real symmetric matrix withits ijth entry equal to max{di, dj} if the vertices vi and vj are adjacent inG, 0 otherwise.
Rangarajan, R., Raghu, V. D., Rakshith, B. R.   +2 more
openaire   +1 more source

New Bounds for the Generalized Distance Spectral Radius/Energy of Graphs

Mathematical Problems in Engineering, Volume 2022, Issue 1, 2022., 2022
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, Yubin Gao, Yanling Shao, Yusuf Gurefe   +3 more
wiley   +1 more source