Highly irregular graphs

Yousef Alavi, Gary Chartrand, F. R K Chung, P. Erdős, R. L. Graham, Ortrud R. Oellermann

Research output: Contribution to journalArticle

55 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)235-249
Number of pages15
JournalJournal of Graph Theory
Volume11
Issue number2
DOIs
Publication statusPublished - 1987

Fingerprint

Irregular
Graph in graph theory
Independence number
Enumeration
Connected graph
Adjacent
Distinct

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Alavi, Y., Chartrand, G., Chung, F. R. K., Erdős, P., Graham, R. L., & Oellermann, O. R. (1987). Highly irregular graphs. Journal of Graph Theory, 11(2), 235-249. https://doi.org/10.1002/jgt.3190110214

Highly irregular graphs. / Alavi, Yousef; Chartrand, Gary; Chung, F. R K; Erdős, P.; Graham, R. L.; Oellermann, Ortrud R.

In: Journal of Graph Theory, Vol. 11, No. 2, 1987, p. 235-249.

Research output: Contribution to journalArticle

Alavi, Y, Chartrand, G, Chung, FRK, Erdős, P, Graham, RL & Oellermann, OR 1987, 'Highly irregular graphs', Journal of Graph Theory, vol. 11, no. 2, pp. 235-249. https://doi.org/10.1002/jgt.3190110214
Alavi Y, Chartrand G, Chung FRK, Erdős P, Graham RL, Oellermann OR. Highly irregular graphs. Journal of Graph Theory. 1987;11(2):235-249. https://doi.org/10.1002/jgt.3190110214
Alavi, Yousef ; Chartrand, Gary ; Chung, F. R K ; Erdős, P. ; Graham, R. L. ; Oellermann, Ortrud R. / Highly irregular graphs. In: Journal of Graph Theory. 1987 ; Vol. 11, No. 2. pp. 235-249.
@article{f6f9f87e88da4fc6bf9f9e1b4ed60a04,
title = "Highly irregular graphs",
abstract = "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.",
author = "Yousef Alavi and Gary Chartrand and Chung, {F. R K} and P. Erdős and Graham, {R. L.} and Oellermann, {Ortrud R.}",
year = "1987",
doi = "10.1002/jgt.3190110214",
language = "English",
volume = "11",
pages = "235--249",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "2",

}

TY - JOUR

T1 - Highly irregular graphs

AU - Alavi, Yousef

AU - Chartrand, Gary

AU - Chung, F. R K

AU - Erdős, P.

AU - Graham, R. L.

AU - Oellermann, Ortrud R.

PY - 1987

Y1 - 1987

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84986516373&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84986516373&partnerID=8YFLogxK

U2 - 10.1002/jgt.3190110214

DO - 10.1002/jgt.3190110214

M3 - Article

AN - SCOPUS:84986516373

VL - 11

SP - 235

EP - 249

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -