Results 191 to 200 of about 1,962 (215)
Some of the next articles are maybe not open access.
On bicyclic graphs with minimal energies
Journal of Mathematical Chemistry, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianbin Zhang, Bo Zhou
exaly +3 more sources
ON THE NULL-SPACES OF BICYCLIC SINGULAR GRAPHS
Discrete Mathematics, Algorithms and Applications, 2011 In [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.
MILAN NATH
openaire +2 more sources
2023
Summary: The PI index of a graph \(G\) is given by \(\operatorname{PI}(G)=\sum_{e\in E(G)} (|V(G)|-N_G(e))\), where \(N_G(e)\) is the number of equidistant vertices for the edge \(e\). Various topological indices of bicyclic graphs have already been calculated. In this paper, we obtained the exact value of the PI index of bicyclic graphs.
SC, Manju, K, Somasundaram
openaire +2 more sources
Summary: The PI index of a graph \(G\) is given by \(\operatorname{PI}(G)=\sum_{e\in E(G)} (|V(G)|-N_G(e))\), where \(N_G(e)\) is the number of equidistant vertices for the edge \(e\). Various topological indices of bicyclic graphs have already been calculated. In this paper, we obtained the exact value of the PI index of bicyclic graphs.
SC, Manju, K, Somasundaram
openaire +2 more sources
Bicyclic graphs with extremal cover cost
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian Lu, Xiang-Feng Pan, Huiqing Liu
openaire +1 more source
On the k-matchings of the complements of bicyclic graphs
Discrete Mathematics, Algorithms and Applications, 2018A matching of a graph [Formula: see text] is a set of pairwise nonadjacent edges of [Formula: see text], and a [Formula: see text]-matching is a matching consisting of [Formula: see text] edges. In this paper, we characterize the bicyclic graphs whose complements have the extremal number of [Formula: see text]-matchings for all [Formula: see text].
Hong-Hai Li, Yi-Ping Liang
openaire +2 more sources
Extremal Bicyclic 3-Chromatic Graphs
Graphs and Combinatorics, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ioan Tomescu, Sana Javed
openaire +1 more source
The Hitting Times of Random Walks on Bicyclic Graphs
Graphs and Combinatorics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaomin Zhu, Xiao-Dong Zhang 0001
openaire +2 more sources
Some results on the spectral radii of bicyclic graphs
Discrete Mathematics, 2010 A bicyclic graph is a connected graph in which the number of edges equals the number of vertices plus one. Let Δ(G) and ρ(G) denote the maximum degree and the spectral radius of a graph G, respectively.
Yan Chen +3 more
exaly +2 more sources
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 0006, Shenggui Zhang
openaire +1 more source
On Sombor Index of Unicyclic and Bicyclic Graphs
Journal of Interconnection NetworksGutman proposed a topological index called the Sombor index, which was defined as [Formula: see text] where [Formula: see text] is the degree of the vertex [Formula: see text] in graph [Formula: see text]. In this paper, we determine the second-minimum and second-maximum values of the Sombor index over all the unicyclic graphs of order [Formula: see ...
Huan Tan, Biao Zhao
openaire +1 more source