Results 61 to 70 of about 1,309,008 (158)
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 +4 more
wiley +1 more source
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 +3 more
wiley +1 more source
Maxima of the signless Laplacian spectral radius for planar graphs [PDF]
, 2015 The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacian. In this paper, we prove that the graph $K_{2}\nabla P_{n-2}$ has the maximal signless Laplacian spectral radius among all planar graphs of order $n\geq
Yu, Guanglong +2 more
core +1 more source
International Journal of Quantum Chemistry, Volume 124, Issue 11, June 5, 2024.Molecular structures. Abstract Malaria has a wide impact on the healthcare system, affecting everyone from hyperendemic areas who dearth access to medical treatment to international tourists returning to nonendemic regions with tertiary referral care. Implementing timely and accurate diagnosis is necessary to stop malaria's growing global effect, which
Nadeem ul Hassan Awan +5 more
wiley +1 more source
On some aspects of the generalized Petersen graph
Electronic Journal of Graph Theory and Applications, 2017 Let $p \ge 3$ be a positive integer and let $k \in {1, 2, ..., p-1} \ \lfloor p/2 \rfloor$. The generalized Petersen graph GP(p,k) has its vertex and edge set as $V(GP(p, k)) = \{u_i : i \in Zp\} \cup \{u_i^\prime : i \in Z_p\}$ and $E(GP(p, k)) = \{u_i ...
V. Yegnanarayanan
doaj +1 more source
On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue
Mathematics, 2021 The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the ...
Maryam Baghipur +3 more
doaj +1 more source
Bounds of signless Laplacian spectrum of graphs based on the k -domination number
Linear Algebra and its Applications, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Huiqing, Lu, Mei
openaire +1 more source
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
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 +4 more
wiley +1 more source
On maximum degree (signless) Laplacian matrix of a graph
, 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}
Raghu, V. D. +2 more
core +1 more source