𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs

✍ Scribed by Fengxia Liu, Zhao Zhang, Jixiang Meng

Book ID
120788842
Publisher
Springer Japan
Year
2013
Tongue
English
Weight
592 KB
Volume
30
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Size in maximal triangle-free graphs and
Size in maximal triangle-free graphs and minimal graphs of diameter 2
✍ Curtiss Barefoot; Karen Casey; David Fisher; Kathryn Fraughnaugh; Frank Harary πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 290 KB

A triangle-free graph is maximal if the addition of any edge creates a triangle. For n ~> 5, we show there is an n-node m-edge maximal triangle-free graph if and only if it is complete bipartite or 2n-5<<.m<<.L(n-1)2/4J+l. A diameter 2 graph is minimal if the deletion of any edge increases the diame

The size of strength-maximal graphs
The size of strength-maximal graphs
✍ Hong-Jian Lai πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 381 KB πŸ‘ 1 views

## Abstract Let __G__ be a graph and let __k__β€²(__G__) be the edge‐connectivity of __G__. The __strength__ of __G__, denoted by kΜ„β€²(__G__), is the maximum value of __k__β€²(__H__), where __H__ runs over all subgraphs of __G__. A simple graph __G__ is called k‐__maximal__ if kΜ„β€²(__G__) ≀ __k__ but for