✦ LIBER ✦

Complete solution to a problem on the maximal energy of unicyclic bipartite graphs

✍ Scribed by Bofeng Huo; Xueliang Li; Yongtang Shi

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 197 KB
Volume: 434
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.11.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solution to a conjecture on the maximal

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

✍ Bofeng Huo; Shengjin Ji; Xueliang Li; Yongtang Shi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB

An edge grafting theorem on the energy o

An edge grafting theorem on the energy of unicyclic and bipartite graphs

✍ Hai-Ying Shan; Jia-Yu Shao; Fei Gong; Yue Liu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 159 KB

The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The edge grafting operation on a graph is certain kind of edge moving between two pendant paths starting from the same vertex. In this paper we show how the graph energy changes under the edge graftin

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

NP completeness of the edge precoloring

NP completeness of the edge precoloring extension problem on bipartite graphs

✍ Jiří Fiala 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 1 views

## Abstract We show that the following problem is __NP__ complete: Let __G__ be a cubic bipartite graph and __f__ be a precoloring of a subset of edges of __G__ using at most three colors. Can __f__ be extended to a proper edge 3‐coloring of the entire graph __G__? This result provides a natural co

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)

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