Results 191 to 200 of about 1,442 (223)

Unicyclic and bicyclic graphs having minimum degree distance

Discrete Applied Mathematics, 2008
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degree distance are ...
Alexandru I Tomescu
exaly   +2 more sources

Bicyclic graphs with extremal values of PI index

Discrete Applied Mathematics, 2013
We give sharp lower and upper bounds on the PI index of connected bicyclic graphs with constant number of vertices and characterize the case of equality for both ...
Zana Kovijanić Vukicevic, Dragan Stevanovic   +1 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Bicyclic graphs with extremal cover cost

Applied Mathematics and Computation, 2021
zbMATH 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, 2018
A 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, 2014
zbMATH 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, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaomin Zhu, Xiao-Dong Zhang 0001
openaire   +2 more sources

On the spectral moment of quasi-bicyclic graphs

Applied Mathematics and Computation, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Longfei Fang, Bing Wang, Mingqing Zhai
openaire   +2 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.
openaire   +1 more source

Computing the Scattering Number of Bicyclic Graphs

2010 International Conference on Computational Intelligence and Security, 2010
The 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 Networks
Gutman 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