Bounding functions and rigid graphs

A function $f$bounds graphs from above if there exists an infinite family of graphs $\mathcal{G}$, such that if $G \in \mathcal{G}$ then $f(| V_G |) = | E_G |$ and for all nonempty subgraphs $H$ of $G$ we have that $f(| V_H |) \geq | E_H |$. This paper considers the question: Which functions bound g...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on discrete mathematics 1996-05, Vol.9 (2), p.269-273
Hauptverfasser:	ALBERTSON, M. O, HAAS, R
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Combinatorics Combinatorics. Ordered structures Computer science control theory systems Exact sciences and technology Graph theory Graphs Inequality Information retrieval. Graph Mathematics Sciences and techniques of general use Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A function $f$bounds graphs from above if there exists an infinite family of graphs $\mathcal{G}$, such that if $G \in \mathcal{G}$ then $f(\| V_G \|) = \| E_G \|$ and for all nonempty subgraphs $H$ of $G$ we have that $f(\| V_H \|) \geq \| E_H \|$. This paper considers the question: Which functions bound graphs?
ISSN:	0895-4801 1095-7146
DOI:	10.1137/0409023