Results 171 to 178 of about 6,554 (178)
Some of the next articles are maybe not open access.
On Randić indices of trees, unicyclic graphs, and bicyclic graphs
International Journal of Quantum Chemistry, 2011AbstractThe Randić (connectivity) index is one of the most successful molecular descriptors in structure‐property and structure‐activity relationships studies. We determine the n‐vertex trees with the third for n ≥ 7, the fourth for n ≥ 10, the fifth and the sixth for n ≥ 11 maximum Randić indices, unicyclic graphs with the third for n ≥ 5, the fourth ...
Zhibin Du, Bo Zhou
openaire +1 more source
Trees, unicyclic graphs and bicyclic graphs with exactly two Q-main eigenvalues
Acta Mathematica Sinica, English Series, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Lin, Huang, Qiong Xiang
openaire +1 more source
Bicyclic oriented graphs with skew-rank 6
Applied Mathematics and Computation, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lu, Yong, Wang, Ligong, Zhou, Qiannan
openaire +1 more source
Computing the Scattering Number of Bicyclic Graphs
2010 International Conference on Computational Intelligence and Security, 2010The scattering number of a noncomplete connected graph $G$ is defined by $s(G)=\max\{\omega(G-X)-|X|:X\subset V(G), \omega(G-X)\ge 2\}$, where $\omega(G-X)$ denotes the number of components of $G-X$. This parameter can be used to measure the vulnerability of networks.
Bing Chen, Shenggui Zhang
openaire +1 more source
ON THE NULL-SPACES OF BICYCLIC SINGULAR GRAPHS
Discrete Mathematics, Algorithms and Applications, 2011In [M. Nath and B. K. Sarma, On the null-spaces of unicyclic and acyclic graphs, Linear Algebra Appl.427 (2007) 42–54], Nath and Sarma gave an algorithm to find a basis for the null-space of a graph G when G is singular acyclic or unicyclic. In this paper, we find a basis for the null-space of G when G is a bicyclic singular graph.
openaire +1 more source
Extremal Arithmetic–Geometric Index of Bicyclic Graphs
Circuits, Systems, and Signal Processing, 2023Niu, Baohua, Zhou, Shuming, Zhang, Hong
openaire +1 more source
Bicyclic Graphs with Nullity n−5
2013Let \( G \) be a simple undirected graph on n vertices, \( A(G) \) be its adjacency matrix. The nullity \( \eta (G) \) of the graph \( G \) is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we characterize the bicyclic graphs with nullity \( n - 5 \).
openaire +1 more source