Graphical parameters for classes of tumbling block graphs

MaRDI QIDQ2869394zbMATH OpenFDO

Authors Suk J. Seo, Peter Slater

Publication date 3 January 2014

Published in Congressus Numerantium (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2202.02620

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: The infinite tumbling block graph is a bipartite graph, where each vertex in one partite set is of degree 3 and each vertex in the other partite set is of degree 6. It is a 2-dimensional array of blocks of seven vertices and nine edges, a planar graph that has 3-D looks. This paper introduces tumbling block graphs and considers various graphical parameters for different classes of infinite and finite tumbling blocks.

Recommendations

• Bipartite finite Toeplitz graphs
• Graphs obtained from collections of blocks
• Characterizing bipartite Toeplitz graphs
• The structure of locally finite two-connected graphs
• Infinite Turán problems for bipartite graphs

Cited in

(6)

• Fault-tolerant detectors for distinguishing sets in cubic graphs
• Open-independent, open-locating-dominating sets
• Fault-tolerant locating-dominating sets on the infinite tumbling block graph
• Fault-tolerant detection systems on the infinite King grid
• Optimal error-detecting open-locating-dominating set on the infinite triangular grid
• Fault tolerant detectors for distinguishing sets in graphs

This page was built for publication: Graphical parameters for classes of tumbling block graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869394)