Highly irregular graphs

Autor:	Ron Graham, Fan Chung, Ortrud R. Oellermann, Gary Chartrand, Yousef Alavi, Paul Erdös
Rok vydání:	1987
Předmět:	Discrete mathematics Combinatorics Enumeration k-vertex-connected graph Discrete Mathematics and Combinatorics Existence theorem Graph theory Geometry and Topology Focus (optics) Independence (probability theory) Connectivity MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	Journal of Graph Theory. 11:235-249
ISSN:	1097-0118 0364-9024
DOI:	10.1002/jgt.3190110214
Popis:	A connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we investigate several problems concerning the existence and enumeration of highly irregular graphs as well as their independence numbers, with particular focus on the corresponding problems for highly irregular trees.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::4178d0420c706d70b04e25854df88bbc https://doi.org/10.1002/jgt.3190110214 Zobrazit plný text záznamu Plný text