Graphical parameters for classes of tumbling block graphs

02/05/2022
by   Suk J. Seo, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/10/2020

Finding Efficient Domination for S_1,3,3-Free Bipartite Graphs in Polynomial Time

A vertex set D in a finite undirected graph G is an efficient dominating...
research
10/29/2020

Finding Efficient Domination for S_1,1,5-Free Bipartite Graphs in Polynomial Time

A vertex set D in a finite undirected graph G is an efficient dominating...
research
12/30/2019

Computing 2-twinless blocks

Let G=(V,E)) be a directed graph. A 2-twinless block in G is a maximal v...
research
08/23/2019

Graphical Construction of Spatial Gibbs Random Graphs

We present a Spatial Gibbs Random Graphs Model that incorporates the int...
research
01/21/2018

Preferential Attachment Graphs with Planted Communities

A variation of the preferential attachment random graph model of Barabás...
research
12/10/2013

Vertex nomination schemes for membership prediction

Suppose that a graph is realized from a stochastic block model where one...
research
09/08/2019

A Generalized Configuration Model with Degree Correlations and Its Percolation Analysis

In this paper we present a generalization of the classical configuration...

Please sign up or login with your details

Forgot password? Click here to reset