Results 71 to 80 of about 110,880 (163)

Sufficient Conditions for Spanning k‐Hypertrees via Distance Spectral Radius of Hypergraphs

Journal of Mathematics, Volume 2026, Issue 1, 2026.
For an integer k ≥ 2, a spanning k‐hypertree T is defined as a spanning hypertree (β‐acyclic) such that the maximum degree dT(v) of every vertex v ∈ V(T) is at most k. A sufficient condition for the existence of a spanning k‐hypertree in connected hypergraphs is established.
Qiannan Niu, Jinyu Zou, Lei Zhang, Haizhen Ren, Zafar Ullah   +4 more
wiley   +1 more source

On the signless Laplacian and normalized signless Laplacian spreads of graphs

, 2022
Let G = (V, E), V = {v1, v2, …, vn}, be a simple connected graph with n vertices, m edges and a sequence of vertex degrees d1 ≽ d2 ≽ … ≽ dn. Denote by A and D the adjacency matrix and diagonal vertex degree matrix of G, respectively.
Igor Milovanović, Serife B. Bozkurt Altindağ, Bozkurt Altındağ, Şerife Burcu, Emina Milovanović, Matejić, Marjan, Altındağ, Şerife Burcu Bozkurt, Milovanović, Igor, Marjan Matejić, Milovanovic, Emina   +8 more
core   +1 more source

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

Journal of Mathematics, Volume 2025, Issue 1, 2025.
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. Motivated by the need to understand how helical topology influences network dynamics and robustness, we derive exact analytical expressions for three key ...
Fareeha Hanif, Ali Raza, Md. Shajib Ali, Pramita Mishra   +3 more
wiley   +1 more source

Applications on color (distance) signless laplacian energy of annihilator monic prime graph of commutative rings

Ain Shams Engineering Journal
In 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   +1 more source

Pointwise eigenvector estimates by landscape functions: Some variations on the Filoche–Mayboroda–van den Berg bound

Mathematische Nachrichten, Volume 297, Issue 5, Page 1749-1771, May 2024.
Abstract Landscape functions are a popular tool used to provide upper bounds for eigenvectors of Schrödinger operators on domains. We review some known results obtained in the last 10 years, unify several approaches used to achieve such bounds, and extend their scope to a large class of linear and nonlinear operators. We also use landscape functions to
Delio Mugnolo
wiley   +1 more source

Ordering Planar Graphs by Their Signless Laplacian Spectral Radii

Axioms
A graph is planar if it can be embedded in the plane such that its edges intersect only at their common endpoints. In this paper, we determine the graphs attaining the second and third largest signless Laplacian spectral radii among all planar graphs of ...
Ke Wang, Zhen Lin, Shumin Zhang, Chengfu Ye   +3 more
doaj   +1 more source

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  

Distance Spectra of Some Double Join Operations of Graphs

International Journal of Mathematics and Mathematical Sciences, Volume 2024, Issue 1, 2024.
In literature, several types of join operations of two graphs based on subdivision graph, Q‐graph, R‐graph, and total graph have been introduced, and their spectral properties have been studied. In this paper, we introduce a new double join operation based on (H1, H2)‐merged subdivision graph.
B. J. Manjunatha, B. R. Rakshith, K. N. Prakasha, N. V. Sayinath Udupa, Abdul Rauf Khan   +4 more
wiley   +1 more source

Color laplacian and color signless laplacian energy of complement of subgroup graph of dihedral group [PDF]

, 2020
Laplacian and signless laplacian energy of a finite graph is the most interesting topics on areas of energy of a graph. The new concept of energy of a graph is color energy and furthermore color laplacian and color signless laplacian energy.
Mohammad Jauhari, Lila Puspitasari, Puspitasari, Lila Aryani, Abdussakir Abdussakir, Nabila Umar, Abdussakir, Abdussakir, Jauhari, Mohammad Nafie, Umar, Nabila   +7 more
core   +1 more source

Signless Laplacian spectrum of power graphs of finite cyclic groups

AKCE International Journal of Graphs and Combinatorics, 2020
In this paper, we have studied the Signless Laplacian spectrum of the power graph of finite cyclic groups. We have shown that is an eigen value of Signless Laplacian of the power graph of with multiplicity at least In particular, using the theory of ...
Subarsha Banerjee, Avishek Adhikari
doaj   +1 more source