Results 41 to 50 of about 3,180,841 (100)

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

The smallest eigenvalue of the signless Laplacian [PDF]

, 2011
Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are many results about the largest eigenvalue of the signless Laplacian, the properties of its smallest eigenvalue are less well studied.
Nikiforov, Vladimir, Oliveira, Carla Silva, Leonardo Silva de Lima, Vladimir Nikiforov, Nair Maria Maia de Abreu, Carla Silva Oliveira, de Lima, Leonardo Silva, de Abreu, Nair Maria Maia   +7 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

Bounds for the signless Laplacian energy [PDF]

, 2011
The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. The Laplacian (respectively, the signless Laplacian) energy of G is the sum of the absolute values of the differences between the eigenvalues of ...
Martins, Enide A., Robbiano, Marı´a, Nair Abreu, Enide A. Martins, Abreu, Nair, Cardoso, Domingos M., Gutman, Ivan, Ivan Gutman, Marı´a Robbiano, Domingos M. Cardoso   +9 more
core   +1 more source

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

Further results on the distance signless Laplacian spectrum of graphs

, 2018
The distance signless Laplacian matrix [Formula: see text] of a connected graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix
Abdollah Alhevaz, Ebrahim Hashemi, Maryam Baghipur   +2 more
core   +1 more source

On conjectures involving second largest signless Laplacian eigenvalue of graphs [PDF]

, 2010
Let G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then the Laplacian matrix of G is L(G)=D(G)-A(G) and the signless Laplacian matrix of G is Q(G)=D(G)+A(G). In this paper we obtain a
Das, Kinkar Ch.
core   +1 more source

Transmission-Based Energies of Prime Coprime Graph for Integers Modulo Group

Science and Technology Indonesia
Graphs are an excellent instrument that provides an algebraic structure for visualizing and interpreting molecule structures and characteristics. As a result, the problem statement arises regarding how we can interpret graphs with eigenvalues concerning
Mamika Ujianita Romdhini, Abdurahim, Andika Ellena Saufika Hakim Maharani, Siti Raudhatul Kamali   +3 more
doaj   +1 more source

Distance signless Laplacian eigenvalues, diameter, and clique number [PDF]

Discrete Mathematics Letters, 2022
Saleem Khan, Shariefuddin Pirzada
doaj   +1 more source

Universal Adjacency Matrices with Two Eigenvalues [PDF]

AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Omidi, G.R., Haemers, W.H.
core