๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the entropy minimal hereditary classes of colored graphs

โœ Scribed by V. E. Alekseev; S. V. Sorochan

Book ID
111471271
Publisher
Pleiades Publishing
Year
2010
Tongue
English
Weight
425 KB
Volume
4
Category
Article
ISSN
1990-4789

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Size of Hereditary Classes of Gra
On the Size of Hereditary Classes of Graphs
โœ E.R Scheinerman; J Zito ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 912 KB

A hereditary property of graphs is a class of graphs which is closed under taking induced subgraphs. For a hereditary property \(\mathscr{P}\), let \(\mathscr{P}_{n}\) denote the set of \(\mathscr{P}\) graphs on \(n\) labelled vertices. Clearly we have \(0 \leqslant\left|\mathscr{P}_{n}\right| \leqs

On the structure of hereditary classes o
On the structure of hereditary classes of graphs
โœ Edward R. Scheinerman ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 333 KB ๐Ÿ‘ 1 views

A class of graphs is hereditary if it is closed under taking induced subgraphs. Classes associated with graph representations have "composition sequences" and we show that this concept is equivalent to a notion of "amalgamation" which generalizes disjoint union of graphs. We also discuss how general

Minimal energy on a class of graphs
Minimal energy on a class of graphs
โœ Maolin Wang; Hongbo Hua; Dongdong Wang ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Springer ๐ŸŒ English โš– 205 KB