𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solution to a conjecture on the maximal energy of bipartite bicyclic graphs

✍ Scribed by Bofeng Huo; Shengjin Ji; Xueliang Li; Yongtang Shi

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
200 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the number of maximal bipartite subgr
On the number of maximal bipartite subgraphs of a graph
✍ Jesper Makholm Byskov; Bolette AmmitzbΓΈll Madsen; Bjarke Skjernaa πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 72 KB πŸ‘ 2 views

We show new lower and upper bounds on the maximum number of maximal induced bipartite subgraphs of graphs with n vertices. We present an infinite family of graphs having 105 n=10 % 1:5926 n ; such subgraphs show an upper bound of O(12 n=4 ) ΒΌ O(1:8613 n ) and give an algorithm that finds all maximal

A solution to Gutman's problem on the ch
A solution to Gutman's problem on the characteristic polynomial of a bipartite graph
✍ Xueliang Li; Heping Zhang πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 209 KB

In this short paper, we present a solution to Gutman's problem on the characteristic polynomial of a bipartite graph (Research Problem 134, Discrete Math. 88 (1991)). In [2] I. Gutman proposed a research problem which is stated as follows. The matchings polynomial of a graph G is defined by cl(G,x)

A counterexample to a conjecture on the
A counterexample to a conjecture on the bondage number of a graph
✍ Ulrich Teschner πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 113 KB

The bondage number h(G) of a nonempty graph G was first introduced by Fink, Jacobson, Kinch and Roberts in [3]. They generalized a former approach to domination-critical graphs, In their publication they conjectured that b(G)<d(G)+ 1 for any nonempty graph G.

The solution to an extremal problem on b
The solution to an extremal problem on balanced extensions of graphs
✍ A. RuciΕ„ski; A. Vince πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 694 KB

## Abstract For __n__ sufficiently large the order of a smallest balanced extension of a graph of order __n__ is, in the worst case, ⌊(__n__ + 3)^2^/8βŒ‹. Β© 1993 John Wiley & Sons, Inc.