✦ LIBER ✦

Maximum order of trees and bipartite graphs with a given rank

✍ Scribed by E. Ghorbani; A. Mohammadian; B. Tayfeh-Rezaie

Book ID: 118735025
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 222 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.07.040

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum order of adjacency matrices

The maximum order of adjacency matrices of graphs with a given rank

✍ W. H. Haemers, M. J. P. Peeters 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 151 KB

Wiener indices of trees and monocyclic g

Wiener indices of trees and monocyclic graphs with given bipartition

✍ Zhibin Du 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. It has found various applications in chemical research. We determine the minimum and the maximum Wiener indices of trees with given bipartition and the minimum Wiener in

Maximum matching of given weight in comp

Maximum matching of given weight in complete and complete bipartite graphs

✍ A. V. Karzanov 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 641 KB

Laplacian coefficients of trees with a g

Laplacian coefficients of trees with a given bipartition

✍ Weiqi Lin; Weigen Yan 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 658 KB

The maximum radius of graphs with given

The maximum radius of graphs with given order and minimum degree

✍ Byeong Moon Kim; Yoomi Rho; Byung Chul Song; Woonjae Hwang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 205 KB

The Size of Bipartite Graphs with a Give

The Size of Bipartite Graphs with a Given Girth

✍ Shlomo Hoory 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 90 KB