Results 81 to 90 of about 6,081 (145)

Laplacian spectral characterization of some double starlike trees [PDF]

open access: yes, 2013
A tree is called double starlike if it has exactly two vertices of degree greater than two. Let $H(p,n,q)$ denote the double starlike tree obtained by attaching $p$ pendant vertices to one pendant vertex of the path $P_n$ and $q$ pendant vertices to the ...
Liu, Xiaogang, Lu, Pengli
core   +1 more source

Riemannian-geometric entropy for measuring network complexity [PDF]

open access: yes, 2016
A central issue of the science of complex systems is the quantitative characterization of complexity. In the present work we address this issue by resorting to information geometry.
Felice, Domenico   +3 more
core   +2 more sources

Integral Eigen‐Pair Balanced Classes of Graphs with Their Ratio, Asymptote, Area, and Involution‐Complementary Aspects

open access: yesInternational Journal of Combinatorics, Volume 2014, Issue 1, 2014., 2014
The association of integers, conjugate pairs, and robustness with the eigenvalues of graphs provides the motivation for the following definitions. A class of graphs, with the property that, for each graph (member) of the class, there exists a pair a, b of nonzero, distinct eigenvalues, whose sum and product are integral, is said to be eigen-bibalanced.
Paul August Winter   +2 more
wiley   +1 more source

On Laplacian-energy-like invariant and incidence energy [PDF]

open access: yesInternational 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  

Some improved bounds on two energy-like invariants of some derived graphs

open access: yesOpen Mathematics, 2019
Given a simple graph G, its Laplacian-energy-like invariant LEL(G) and incidence energy IE(G) are the sum of square root of its all Laplacian eigenvalues and signless Laplacian eigenvalues, respectively. This paper obtains some improved bounds on LEL and
Cui Shu-Yu, Tian Gui-Xian
doaj   +1 more source

QSPR analysis for physiochemical properties of new potential antimalarial compounds involving topological indices

open access: yesInternational 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

Energy Conditions for Hamiltonicity of Graphs

open access: yesDiscrete Dynamics in Nature and Society, Volume 2014, Issue 1, 2014., 2014
Let G be an undirected simple graph of order n. Let A(G) be the adjacency matrix of G, and let μ1(G) ≤ μ2(G)≤⋯≤μn(G) be its eigenvalues. The energy of G is defined as ℰ(G)=∑i=1n |μi(G)|. Denote by GBPT a bipartite graph. In this paper, we establish the sufficient conditions for G having a Hamiltonian path or cycle or to be Hamilton‐connected in terms ...
Guidong Yu   +4 more
wiley   +1 more source

Randi\'c energy and Randi\'c eigenvalues [PDF]

open access: yes, 2014
Let $G$ be a graph of order $n$, and $d_i$ the degree of a vertex $v_i$ of $G$. The Randi\'c matrix ${\bf R}=(r_{ij})$ of $G$ is defined by $r_{ij} = 1 / \sqrt{d_jd_j}$ if the vertices $v_i$ and $v_j$ are adjacent in $G$ and $r_{ij}=0$ otherwise.
Li, Xueliang, Wang, Jianfeng
core  

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

open access: yesMathematische 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

Bounds for Incidence Energy of Some Graphs

open access: yesJournal of Applied Mathematics, Volume 2013, Issue 1, 2013., 2013
Let G be a simple graph. The incidence energy (IE for short) of G is defined as the sum of the singular values of the incidence matrix. In this paper, a new upper bound for IE of graphs in terms of the maximum degree is given. Meanwhile, bounds for IE of the line graph of a semiregular graph and the paraline graph of a regular graph are obtained.
Weizhong Wang, Dong Yang, Magdy A. Ezzat
wiley   +1 more source

Home - About - Disclaimer - Privacy