Bounded degrees and prescribed distances in graphs

Yair Caro, Z. Tuza

Research output: Contribution to journalArticle

Abstract

Let X = {x1,...,xm} and Y = {y1,...,ym} be two disjoints sets of vertices in a graph G. Then (X,Y) is called an antipodal set-pair of size m(m-ASP, for short) if the distance of xi and yj is at most two if and only if i ≠ j. We prove that in a graph of maximum degree k every m-ASP has size m≤ k(k + 1) 2 + 1. This upper bound is nearly best possible since, for every k≥2, there exists a regular graph of degree k, with an m-ASP, m≥ k(k+1) 2 (and m = k(k + 1) 2 + 1 when k ≡ 0 or 1 (mod 4)). If the degrees of the xi and yj are bounded above by p and q, respectively, then an m-ASP can exist only for m≤(p + q + 1p). We conjecture that this bound cán be improved to m≤(p + pq), and verify this conjecture when the graph satisfies some additional assumptions.

Original languageEnglish
Pages (from-to)87-93
Number of pages7
JournalDiscrete Mathematics
Volume111
Issue number1-3
DOIs
Publication statusPublished - Feb 22 1993

Fingerprint

Distance in Graphs
Graph in graph theory
Regular Graph
Maximum Degree
Disjoint
Verify
Upper bound
If and only if

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Bounded degrees and prescribed distances in graphs. / Caro, Yair; Tuza, Z.

In: Discrete Mathematics, Vol. 111, No. 1-3, 22.02.1993, p. 87-93.

Research output: Contribution to journalArticle

Caro, Yair ; Tuza, Z. / Bounded degrees and prescribed distances in graphs. In: Discrete Mathematics. 1993 ; Vol. 111, No. 1-3. pp. 87-93.
@article{3ffabfb6adcc41fb986a3768cb21e7cc,
title = "Bounded degrees and prescribed distances in graphs",
abstract = "Let X = {x1,...,xm} and Y = {y1,...,ym} be two disjoints sets of vertices in a graph G. Then (X,Y) is called an antipodal set-pair of size m(m-ASP, for short) if the distance of xi and yj is at most two if and only if i ≠ j. We prove that in a graph of maximum degree k every m-ASP has size m≤ k(k + 1) 2 + 1. This upper bound is nearly best possible since, for every k≥2, there exists a regular graph of degree k, with an m-ASP, m≥ k(k+1) 2 (and m = k(k + 1) 2 + 1 when k ≡ 0 or 1 (mod 4)). If the degrees of the xi and yj are bounded above by p and q, respectively, then an m-ASP can exist only for m≤(p + q + 1p). We conjecture that this bound c{\'a}n be improved to m≤(p + pq), and verify this conjecture when the graph satisfies some additional assumptions.",
author = "Yair Caro and Z. Tuza",
year = "1993",
month = "2",
day = "22",
doi = "10.1016/0012-365X(93)90144-I",
language = "English",
volume = "111",
pages = "87--93",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Bounded degrees and prescribed distances in graphs

AU - Caro, Yair

AU - Tuza, Z.

PY - 1993/2/22

Y1 - 1993/2/22

N2 - Let X = {x1,...,xm} and Y = {y1,...,ym} be two disjoints sets of vertices in a graph G. Then (X,Y) is called an antipodal set-pair of size m(m-ASP, for short) if the distance of xi and yj is at most two if and only if i ≠ j. We prove that in a graph of maximum degree k every m-ASP has size m≤ k(k + 1) 2 + 1. This upper bound is nearly best possible since, for every k≥2, there exists a regular graph of degree k, with an m-ASP, m≥ k(k+1) 2 (and m = k(k + 1) 2 + 1 when k ≡ 0 or 1 (mod 4)). If the degrees of the xi and yj are bounded above by p and q, respectively, then an m-ASP can exist only for m≤(p + q + 1p). We conjecture that this bound cán be improved to m≤(p + pq), and verify this conjecture when the graph satisfies some additional assumptions.

AB - Let X = {x1,...,xm} and Y = {y1,...,ym} be two disjoints sets of vertices in a graph G. Then (X,Y) is called an antipodal set-pair of size m(m-ASP, for short) if the distance of xi and yj is at most two if and only if i ≠ j. We prove that in a graph of maximum degree k every m-ASP has size m≤ k(k + 1) 2 + 1. This upper bound is nearly best possible since, for every k≥2, there exists a regular graph of degree k, with an m-ASP, m≥ k(k+1) 2 (and m = k(k + 1) 2 + 1 when k ≡ 0 or 1 (mod 4)). If the degrees of the xi and yj are bounded above by p and q, respectively, then an m-ASP can exist only for m≤(p + q + 1p). We conjecture that this bound cán be improved to m≤(p + pq), and verify this conjecture when the graph satisfies some additional assumptions.

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

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

U2 - 10.1016/0012-365X(93)90144-I

DO - 10.1016/0012-365X(93)90144-I

M3 - Article

AN - SCOPUS:43949172432

VL - 111

SP - 87

EP - 93

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -