On k-pairable graphs

Zhibo Chen

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Motivated by a 1994 result of Graham et al. (Amer. Math. Monthly 101(7) (1994) 664) about spanning trees of the graphs with an antipodal isomorphism, we introduce the concept of k-pairable graphs and extend the result in Graham et al. (Amer. Math. Monthly 101(7) (1994) 664) to this larger class of graphs. We then define a new graph parameter p(G), called the pair length of graph G. This parameter measures the maximum distance, in some sense, between a subgraph induced by half the vertices of G with the isomorphic subgraph induced by the other half of V(G). An upper bound for the parameter p(G) is given. Some properties of the k-pairable graphs and their product graphs are studied. We also post some problems for further research.

Original languageEnglish (US)
Pages (from-to)11-15
Number of pages5
JournalDiscrete Mathematics
Volume287
Issue number1-3
DOIs
StatePublished - Oct 28 2004

Fingerprint

Graph in graph theory
Induced Subgraph
Product Graph
Spanning tree
Isomorphism
Isomorphic
Upper bound

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Chen, Zhibo. / On k-pairable graphs. In: Discrete Mathematics. 2004 ; Vol. 287, No. 1-3. pp. 11-15.
@article{0766097141ad43d88f273fe2ad15f670,
title = "On k-pairable graphs",
abstract = "Motivated by a 1994 result of Graham et al. (Amer. Math. Monthly 101(7) (1994) 664) about spanning trees of the graphs with an antipodal isomorphism, we introduce the concept of k-pairable graphs and extend the result in Graham et al. (Amer. Math. Monthly 101(7) (1994) 664) to this larger class of graphs. We then define a new graph parameter p(G), called the pair length of graph G. This parameter measures the maximum distance, in some sense, between a subgraph induced by half the vertices of G with the isomorphic subgraph induced by the other half of V(G). An upper bound for the parameter p(G) is given. Some properties of the k-pairable graphs and their product graphs are studied. We also post some problems for further research.",
author = "Zhibo Chen",
year = "2004",
month = "10",
day = "28",
doi = "10.1016/j.disc.2004.04.012",
language = "English (US)",
volume = "287",
pages = "11--15",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

On k-pairable graphs. / Chen, Zhibo.

In: Discrete Mathematics, Vol. 287, No. 1-3, 28.10.2004, p. 11-15.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On k-pairable graphs

AU - Chen, Zhibo

PY - 2004/10/28

Y1 - 2004/10/28

N2 - Motivated by a 1994 result of Graham et al. (Amer. Math. Monthly 101(7) (1994) 664) about spanning trees of the graphs with an antipodal isomorphism, we introduce the concept of k-pairable graphs and extend the result in Graham et al. (Amer. Math. Monthly 101(7) (1994) 664) to this larger class of graphs. We then define a new graph parameter p(G), called the pair length of graph G. This parameter measures the maximum distance, in some sense, between a subgraph induced by half the vertices of G with the isomorphic subgraph induced by the other half of V(G). An upper bound for the parameter p(G) is given. Some properties of the k-pairable graphs and their product graphs are studied. We also post some problems for further research.

AB - Motivated by a 1994 result of Graham et al. (Amer. Math. Monthly 101(7) (1994) 664) about spanning trees of the graphs with an antipodal isomorphism, we introduce the concept of k-pairable graphs and extend the result in Graham et al. (Amer. Math. Monthly 101(7) (1994) 664) to this larger class of graphs. We then define a new graph parameter p(G), called the pair length of graph G. This parameter measures the maximum distance, in some sense, between a subgraph induced by half the vertices of G with the isomorphic subgraph induced by the other half of V(G). An upper bound for the parameter p(G) is given. Some properties of the k-pairable graphs and their product graphs are studied. We also post some problems for further research.

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

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

U2 - 10.1016/j.disc.2004.04.012

DO - 10.1016/j.disc.2004.04.012

M3 - Article

VL - 287

SP - 11

EP - 15

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -