Results 121 to 130 of about 1,962 (215)
On Some Distance Spectral Characteristics of Trees
AxiomsGraham and Pollack in 1971 presented applications of eigenvalues of the distance matrix in addressing problems in data communication systems. Spectral graph theory employs tools from linear algebra to retrieve the properties of a graph from the spectrum ...
Sakander Hayat +2 more
doaj +1 more source
Loss of Striatal Bradykinin B2 Receptor Alters Anxiety and Motivational Behaviors in Male Mice
The FASEB Journal, Volume 40, Issue 10, 31 May 2026.Impaired signaling of the bradykinin B2 receptor (B2R) in dorsal striatal neurons decreases anxiety‐like behavior and sucrose preference while enhancing voluntary running in mice. These results reveal a novel role for B2R in dopaminergic circuits that modulate motivation and emotional behavior.
Mariana Rosolen Tavares +5 more
wiley +1 more source
Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
, 2011 The energy of a simple graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let Cn denote the cycle of order n and Pn6,6 the graph obtained from joining two cycles C6 by a path Pn-12 with its ...
Yongtang Shi +7 more
core +1 more source
On the spectral radius of bicyclic graphs with n vertices and diameter d
, 2007 Bicyclic graphs are connected graphs in which the number of edges equals the number of vertices plus one. In this paper we determine the graph with the largest spectral radius among all bicyclic graphs with n vertices and diameter d.
Guo, Shu-Guang
core +1 more source
On Bond Incident Degree Indices of Fixed-Size Bicyclic Graphs with Given Matching Number
MathematicsA connected graph with p vertices and q edges satisfying q=p+1 is referred to as a bicyclic graph. This paper is concerned with an optimal study of the BID (bond incident degree) indices of fixed-size bicyclic graphs with a given matching number. Here, a
Akbar Ali +6 more
doaj +1 more source
The Laplacian spectral radius of bicyclic graphs with a given girth
, 2010 Let ℬ(n,g) be the class of bicyclic graphs on n vertices with girth g. Let ℬ1(n,g) be the subclass of ℬ(n,g) consisting of all bicyclic graphs with two edge-disjoint cycles and ℬ2(n,g)=ℬ(n,g)∖ℬ1(n,g).
Shu, Jinlong +2 more
core +1 more source
On the Exponential Atom-Bond Connectivity Index of Graphs
MathematicsSeveral topological indices are possibly the most widely applied graph-based molecular structure descriptors in chemistry and pharmacology. The capacity of topological indices to discriminate is a crucial component of their study.
Kinkar Chandra Das
doaj +1 more source
On the multiplicative sum Zagreb index of molecular graphs
Open MathematicsMultiplicative sum Zagreb index is a modified version of the famous Zagreb indices. For a graph GG, the multiplicative sum Zagreb index is defined as Π1*(G)=∏uv∈E(G)(dG(u)+dG(v)){\Pi }_{1}^{* }\left(G)={\prod }_{uv\in E\left(G)}\left({d}_{G}\left(u)+{d}_{
Sun Xiaoling, Du Jianwei, Mei Yinzhen
doaj +1 more source
Extremal unicyclic and bicyclic graphs with respect to Harary index
, 2013 The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, we determined the extremal (maximal and minimal) unicyclic and bicyclic graphs with respect to Harary ...
Mohd Aizat bin Mohamad Nor
core +1 more source
Modelling of bicyclic excitation of the LED scale
, 2010 In this work, being based on the theory of sets and matrix formulation of the information area for a bar graph display the author obtained a matrix description for electric signals necessary to form bicyclic excitation of the LED scale elements under ...
Bushma, A.V.
core