Products of graphs with their closed-set lattices

DOI10.1016/0012-365X(88)90053-2zbMath0672.05067MaRDI QIDQ1119944

K. S. Poh, Khee Meng Koh

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Cartesian product of graphsstronglysensitive graphclosed set in a graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (1)

On the lower length of the closed-set lattice of a tree

Cites Work

• On an isomorphism problem on the closed-set lattice of a graph
• On a construction of critical graphs which are not sensitive
• On the uniformity of the closed-set lattice of a tree
• Constructions of sensitive graphs which are not strongly sensitive
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Products of graphs with their closed-set lattices