Odd-angulated graphs and cancelling factors in box products

Zhongyuan Che, Karen L. Collins, Claude Tardif

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Under what conditions is it true that if there is a graph homomorphism G H → G T, then there is a graph homomorphism H → T? Let G be a connected graph of odd girth 2k + 1. We say that G is (2 k + 1 )-angulated if every two vertices of G are joined by a path each of whose edges lies on some (2k + 1)-cycle. We call G strongly (2k + 1)-angulated if every two vertices are connected by a sequence of (2k + 1)-cycles with consecutive cycles sharing at least one edge. We prove that if G is strongly (2k + 1)-angulated, H is any graph, S, T are graphs with odd girth at least 2k+ 1, and φ: G H → S T is a graph homomorphism, then either φ maps G {h} to S {th} for all h ∈ V(H) where th ∈ V(T) depends on h; or φ maps G {h} to {sh} T for all h ∈ V(H) where sh ∈ V(S) depends on h. This theorem allows us to prove several sufficient conditions for a cancelation law of a graph homomorphism between two box products with a common factor. We conclude the article with some open questions.

Original languageEnglish (US)
Pages (from-to)221-238
Number of pages18
JournalJournal of Graph Theory
Volume58
Issue number3
DOIs
StatePublished - Jul 1 2008

Fingerprint

Box Product
Graph Homomorphism
Odd
Girth
Graph in graph theory
Cycle
Common factor
Cancellation
Connected graph
Consecutive
Sharing
Path
Sufficient Conditions
Theorem

All Science Journal Classification (ASJC) codes

  • Geometry and Topology

Cite this

Che, Zhongyuan ; Collins, Karen L. ; Tardif, Claude. / Odd-angulated graphs and cancelling factors in box products. In: Journal of Graph Theory. 2008 ; Vol. 58, No. 3. pp. 221-238.
@article{231f1c85b00a4f5b9c1ac5c1259100b1,
title = "Odd-angulated graphs and cancelling factors in box products",
abstract = "Under what conditions is it true that if there is a graph homomorphism G H → G T, then there is a graph homomorphism H → T? Let G be a connected graph of odd girth 2k + 1. We say that G is (2 k + 1 )-angulated if every two vertices of G are joined by a path each of whose edges lies on some (2k + 1)-cycle. We call G strongly (2k + 1)-angulated if every two vertices are connected by a sequence of (2k + 1)-cycles with consecutive cycles sharing at least one edge. We prove that if G is strongly (2k + 1)-angulated, H is any graph, S, T are graphs with odd girth at least 2k+ 1, and φ: G H → S T is a graph homomorphism, then either φ maps G {h} to S {th} for all h ∈ V(H) where th ∈ V(T) depends on h; or φ maps G {h} to {sh} T for all h ∈ V(H) where sh ∈ V(S) depends on h. This theorem allows us to prove several sufficient conditions for a cancelation law of a graph homomorphism between two box products with a common factor. We conclude the article with some open questions.",
author = "Zhongyuan Che and Collins, {Karen L.} and Claude Tardif",
year = "2008",
month = "7",
day = "1",
doi = "10.1002/jgt.20307",
language = "English (US)",
volume = "58",
pages = "221--238",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "3",

}

Odd-angulated graphs and cancelling factors in box products. / Che, Zhongyuan; Collins, Karen L.; Tardif, Claude.

In: Journal of Graph Theory, Vol. 58, No. 3, 01.07.2008, p. 221-238.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Odd-angulated graphs and cancelling factors in box products

AU - Che, Zhongyuan

AU - Collins, Karen L.

AU - Tardif, Claude

PY - 2008/7/1

Y1 - 2008/7/1

N2 - Under what conditions is it true that if there is a graph homomorphism G H → G T, then there is a graph homomorphism H → T? Let G be a connected graph of odd girth 2k + 1. We say that G is (2 k + 1 )-angulated if every two vertices of G are joined by a path each of whose edges lies on some (2k + 1)-cycle. We call G strongly (2k + 1)-angulated if every two vertices are connected by a sequence of (2k + 1)-cycles with consecutive cycles sharing at least one edge. We prove that if G is strongly (2k + 1)-angulated, H is any graph, S, T are graphs with odd girth at least 2k+ 1, and φ: G H → S T is a graph homomorphism, then either φ maps G {h} to S {th} for all h ∈ V(H) where th ∈ V(T) depends on h; or φ maps G {h} to {sh} T for all h ∈ V(H) where sh ∈ V(S) depends on h. This theorem allows us to prove several sufficient conditions for a cancelation law of a graph homomorphism between two box products with a common factor. We conclude the article with some open questions.

AB - Under what conditions is it true that if there is a graph homomorphism G H → G T, then there is a graph homomorphism H → T? Let G be a connected graph of odd girth 2k + 1. We say that G is (2 k + 1 )-angulated if every two vertices of G are joined by a path each of whose edges lies on some (2k + 1)-cycle. We call G strongly (2k + 1)-angulated if every two vertices are connected by a sequence of (2k + 1)-cycles with consecutive cycles sharing at least one edge. We prove that if G is strongly (2k + 1)-angulated, H is any graph, S, T are graphs with odd girth at least 2k+ 1, and φ: G H → S T is a graph homomorphism, then either φ maps G {h} to S {th} for all h ∈ V(H) where th ∈ V(T) depends on h; or φ maps G {h} to {sh} T for all h ∈ V(H) where sh ∈ V(S) depends on h. This theorem allows us to prove several sufficient conditions for a cancelation law of a graph homomorphism between two box products with a common factor. We conclude the article with some open questions.

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

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

U2 - 10.1002/jgt.20307

DO - 10.1002/jgt.20307

M3 - Article

AN - SCOPUS:47049112137

VL - 58

SP - 221

EP - 238

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 3

ER -