𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximal Energy Bipartite Graphs

✍ Scribed by Jack H. Koolen; Vincent Moulton

Publisher
Springer Japan
Year
2003
Tongue
English
Weight
83 KB
Volume
19
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Maximal independent sets in bipartite gr
Maximal independent sets in bipartite graphs
✍ Jiuqiang Liu πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 458 KB πŸ‘ 1 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G.__ In this paper, we determine the maximum number of maximal independent sets among all bipartite graphs of order __n__ and the extremal graphs as well as

Maximal Energy Graphs
Maximal Energy Graphs
✍ Jack H. Koolen; Vincent Moulton πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 65 KB

Given a graph G, its energy E G is defined as the sum of the absolute values of the eigenvalues of G. The concept of the energy of a graph was introduced in the subject of chemistry by I. Gutman, due to its relevance to the total Ο€-electron energy of certain molecules. In this paper, we show that if

Two trees in maximal planar bipartite gr
Two trees in maximal planar bipartite graphs
✍ Gerhard Ringel πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 127 KB

## Abstract It is proven that each maximal planar bipartite graph is decomposable into two trees. Β© 1993 John Wiley & Sons, Inc.

The maximal number of induced complete b
The maximal number of induced complete bipartite graphs
✍ BΓ©la BollobΓ‘s; ChiΓͺ Nara; Shun-ichi Tachibana πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 230 KB

The aim of this paper is to determine the maximal number of induced K(t, t) subgraphs in graphs of given order and in graphs of given size. Given a graph G and a natural number t, denote by ft(G) the number of induced subgraphs of G isomorphic to K(t, t). Our notation is that of ; in particular, K(