✦ LIBER ✦

CAYLEY GRAPHS OF PARTIALLY ORDERED SETS

✍ Scribed by AFKHAMI, MOJGAN; BARATI, ZAHRA; KHASHYARMANESH, KAZEM

Book ID: 121325859
Publisher: World Scientific Publishing Company
Year: 2013
Tongue: English
Weight: 229 KB
Volume: 12
Category: Article
ISSN: 0219-4988
DOI: 10.1142/S0219498812501848

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Zero-divisor graphs of partially ordered

Zero-divisor graphs of partially ordered sets

✍ Zhanjun Xue; Sanyang Liu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 448 KB

Let (P, ≤) be a partially ordered set (poset, briefly) with a least element 0 and S ⊆ P. An element x ∈ P is a lower bound of S if s ≥ x for all s ∈ S. A simple graph G(P) is associated to each poset P with 0. The vertices of the graph are labeled by the elements of P, and two vertices x, y are conn

Planar zero divisor graphs of partially

Planar zero divisor graphs of partially ordered sets

✍ Afkhami, M.; Barati, Z.; Khashyarmanesh, K. 📂 Article 📅 2012 🏛 Akadmiai Kiad 🌐 English ⚖ 531 KB

Characterization problems for graphs, pa

Characterization problems for graphs, partially ordered sets, lattices, and families of sets

✍ William T. Trotter Jr.; John I. Moore Jr. 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 909 KB

A standard problem in combinatorial theory is to characterize structures which satisfy a certain property by providing a minimum list of forbidden substructures, for example, Kuratowski's well known characterization of planar graphs. In this paper, we establish connections between characterization p

Partially homogeneous partially ordered

Partially homogeneous partially ordered sets

✍ Dan Saracino; Carol Wood 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 421 KB

Efficient dominating sets in Cayley grap

Efficient dominating sets in Cayley graphs

✍ Italo J. Dejter; Oriol Serra 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 506 KB

An independent set C of vertices in a graph is an e cient dominating set (or perfect code) when each vertex not in C is adjacent to exactly one vertex in C. An E-chain is a countable family of nested graphs, each of which has an e cient dominating set. The Hamming codes in the n-cubes provide a clas

Perfect domination sets in Cayley graphs

✍ Kwon, Young Soo; Lee, Jaeun 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 371 KB