Results 91 to 100 of about 1,442 (223)

Bicyclic graphs with exactly two main eigenvalues

, 2009
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one main eigenvalue if and only if it is regular.
Hu, Zhiquan, Li, Shuchao, Zhu, Chunfeng
core   +1 more source

The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with $n$ vertices and $k$ pendant vertices [PDF]

, 2007
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied when some operations, such as edge moving, edge subdividing, are applied to the graph.
Bolian Liu, Tan, Xuezhong, Liu, BoLian, Simić, Slobodan K., Liu, Muhuo, Muhuo Liu, Min, Li, Rowlinson, Peter, Cvetkovic, Dragos, Guo, Guangquan, Xuezhong Tan, Simic, Slobodan K, Wang, Guoping   +12 more
core   +1 more source

Multi‐Targeting Ligands as Prospective Therapeutics for Alzheimer's Disease, a Prevalent Neurodegenerative Disorder: Mechanistic Insights, Emerging Targets and Drug Discovery Campaigns

Medicinal Research Reviews, Volume 46, Issue 4, Page 1173-1229, July 2026.
ABSTRACT Alzheimer's disease (AD) is a debilitating neurodegenerative condition characterized by progressive cognitive impairment, memory deterioration, and neuronal dysfunction. Its complex pathophysiology involves multiple interlinked processes, including amyloid‐β (Aβ) aggregation, tau hyperphosphorylation, oxidative stress, neuroinflammation ...
Amandeep Thakur, Mandeep Rana, Sakshi Vanjani, Kei‐Chi Liou, Rajeev Taliyan, Kunal Nepali, Chih‐Hao Yang   +6 more
wiley   +1 more source

Inclusive cycle training: Using the COM‐B model to examine the attitudes, perceptions and behaviours of cycle instructors

Journal of Research in Special Educational Needs, Volume 26, Issue 3, July 2026.
Abstract This is the first study to comprehensively consider cycle instructor knowledge, motivation and behaviour when teaching children with disabilities. Using a prospective design, we used a questionnaire to measure COM‐B components before (N = 845), immediately after (N = 480) and 6 months after (N = 63) an online course for instructors.
K. Wilmut, S. Gibson, E. L. Davies, C. Purcell   +3 more
wiley   +1 more source

On sum-connectivity index of bicyclic graphs

, 2012
The sum-connectivity index is a new variant of the famous Randic connectivity index usable in quantitative structure-property relationship and quantitative structure-activity relationship studies.
Husna Zayadi
core  

Maximizing the spectral radius of bicyclic graphs with fixed girth

, 2009
Let B(n,g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we determine the unique graph with the maximal spectral radius among all graphs in B(n,g).
Shu, Jinlong, Wu, Yarong, Mingqing Zhai, Yarong Wu, Zhai, Mingqing, Jinlong Shu   +5 more
core   +1 more source

On bicyclic graphs with maximal energy

Linear Algebra and its Applications, 2007
The energy of a graph is the sum the absolute values of its eigenvalues. The main result of the article is the construction of the graph with maximal energy in the set of bicyclic graphs. This result gives a partial solution to Gutman's conjecture for molecular graphs with maximal energy.
Li, Xueliang, Zhang, Jianbin
openaire   +2 more sources

A Unified Framework for Fault‐Tolerant Metric Dimension of Layered Sequential Join Graphs With Applications to Hierarchical Networks

Expert Systems, Volume 43, Issue 7, July 2026.
ABSTRACT Fault‐tolerant monitoring and reliable node identification are essential requirements in modern hierarchical communication systems such as IoT–Fog–Cloud architectures and distributed sensing networks. The fault‐tolerant metric dimension (FTMD) provides an effective graph‐theoretic framework for resilient localization and monitoring in such ...
Ghulam Haidar, Sikander Ali, Murad ul Islam Khan, Altaf Ur Rahman, Wali Khan, Nahaa Eid Alsubaie   +5 more
wiley   +1 more source

On the existence of non-golden signed graphs

Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2018
A signed graph is a pair Γ=(G,σ), where G=(V(G), E(G)) is a graph and σ: E(G) → {+1, -1} is the sign function on the edges of G. For a signed graph we consider the least eigenvalue λ(Γ) of the Laplacian matrix defined as L(Γ)=D(G)-A(Γ), where D(G) is the
Maurizio Brunetti
doaj   +1 more source

On the Laplacian Coefficients of Bicyclic Graphs [PDF]

Universal Journal of Applied Mathematics, 2015
In this paper, we investigate how the Laplacian coefficients changed after some graph transformations. So, I express some results about Laplacian coefficients ordering of graphs, focusing our attention to the bicyclic graphs. Finally, as an application of these results, we discuss the ordering of graphs based on their Laplacian like energy.
openaire   +1 more source