Residually-Complete Graphs

P. Erdős, Frank Harary, Maria Klawe

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

If G is a graph such that the deletion from G of the points in each closed neighborhood results in the complete graph Kn, then we say that G is Kn-residual. Similarly, if the removal of m consecutive closed neighborhoods yields Kn, then G is called m-Kn -residual. We determine the minimum order of the m-Kn-residual graphs for all m and n. The minimum order of the connected Kn-residual graphs is found and all the extremal graphs are specified.

Original languageEnglish
Pages (from-to)117-123
Number of pages7
JournalAnnals of Discrete Mathematics
Volume6
Issue numberC
DOIs
Publication statusPublished - 1980

Fingerprint

Complete Graph
Graph in graph theory
Closed
Extremal Graphs
Deletion
Consecutive

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

Residually-Complete Graphs. / Erdős, P.; Harary, Frank; Klawe, Maria.

In: Annals of Discrete Mathematics, Vol. 6, No. C, 1980, p. 117-123.

Research output: Contribution to journalArticle

Erdős, P. ; Harary, Frank ; Klawe, Maria. / Residually-Complete Graphs. In: Annals of Discrete Mathematics. 1980 ; Vol. 6, No. C. pp. 117-123.
@article{1b29dc6e07ec4bd3a0d4ea3ca9e78f3f,
title = "Residually-Complete Graphs",
abstract = "If G is a graph such that the deletion from G of the points in each closed neighborhood results in the complete graph Kn, then we say that G is Kn-residual. Similarly, if the removal of m consecutive closed neighborhoods yields Kn, then G is called m-Kn -residual. We determine the minimum order of the m-Kn-residual graphs for all m and n. The minimum order of the connected Kn-residual graphs is found and all the extremal graphs are specified.",
author = "P. Erdős and Frank Harary and Maria Klawe",
year = "1980",
doi = "10.1016/S0167-5060(08)70698-8",
language = "English",
volume = "6",
pages = "117--123",
journal = "Annals of Discrete Mathematics",
issn = "0167-5060",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - Residually-Complete Graphs

AU - Erdős, P.

AU - Harary, Frank

AU - Klawe, Maria

PY - 1980

Y1 - 1980

N2 - If G is a graph such that the deletion from G of the points in each closed neighborhood results in the complete graph Kn, then we say that G is Kn-residual. Similarly, if the removal of m consecutive closed neighborhoods yields Kn, then G is called m-Kn -residual. We determine the minimum order of the m-Kn-residual graphs for all m and n. The minimum order of the connected Kn-residual graphs is found and all the extremal graphs are specified.

AB - If G is a graph such that the deletion from G of the points in each closed neighborhood results in the complete graph Kn, then we say that G is Kn-residual. Similarly, if the removal of m consecutive closed neighborhoods yields Kn, then G is called m-Kn -residual. We determine the minimum order of the m-Kn-residual graphs for all m and n. The minimum order of the connected Kn-residual graphs is found and all the extremal graphs are specified.

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

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

U2 - 10.1016/S0167-5060(08)70698-8

DO - 10.1016/S0167-5060(08)70698-8

M3 - Article

VL - 6

SP - 117

EP - 123

JO - Annals of Discrete Mathematics

JF - Annals of Discrete Mathematics

SN - 0167-5060

IS - C

ER -