Hamming dimension of a graph - The case of Sierpiński graphs
نویسندگان
چکیده
The Hamming dimension of a graph G is introduced as the largest dimension of a Hamming graph into which G embeds as an irredundant induced subgraph. An upper bound is proved for the Hamming dimension of Sierpiński graphs S k , k ≥ 3. The Hamming dimension of S 3 grows as 3. Several explicit embeddings are constructed along the way, in particular into products of generalized Sierpiński triangle graphs. The canonical isometric representation of Sierpiński graphs is also explicitly described.
منابع مشابه
Generalized Sierpiński graphs
Sierpiński graphs, S(n, k), were defined originally in 1997 by Klavžar and Milutinović. The graph S(1, k) is simply the complete graph Kk and S(n, 3) are the graphs of Tower of Hanoi problem. We generalize the notion of Sierpiński graphs, replacing the complete graph appearing in the case S(1, k) with any graph. The newly introduced notion of generalized Sierpiński graphs can be seen as a crite...
متن کاملUniform spanning trees on Sierpiński graphs
We study spanning trees on Sierpiński graphs (i.e., finite approximations to the Sierpiński gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpiński graph and show that this construction gives rise to a multi-type Galton-Watson tree. We derive a number of structural results, for instance on the degree distribution....
متن کاملPacking Chromatic Number of Base-3 Sierpiński Graphs
The packing chromatic number (G) of a graph G is the smallest integer k such that there exists a k-vertex coloring of G in which any two vertices receiving color i are at distance at least i + 1. Let S be the base-3 Sierpiński graph of dimension n. It is proved that (S ) = 3, (S ) = 5, (S ) = (S ) = 7, and that 8 ≤ (S ) ≤ 9 holds for any n ≥ 5.
متن کاملSzeged Dimension and $PI_v$ Dimension of Composite Graphs
Let $G$ be a simple connected graph. In this paper, Szeged dimension and PI$_v$ dimension of graph $G$ are introduced. It is proved that if $G$ is a graph of Szeged dimension $1$ then line graph of $G$ is 2-connected. The dimensions of five composite graphs: sum, corona, composition, disjunction and symmetric difference with strongly regular components is computed. Also explicit formulas of Sze...
متن کاملOn Distances in Sierpiński Graphs: Almost-extreme Vertices and Metric Dimension
Sierpiński graphs S p form an extensively studied family of graphs of fractal nature applicable in topology, mathematics of the Tower of Hanoi, computer science, and elsewhere. An almost-extreme vertex of S p is introduced as a vertex that is either adjacent to an extreme vertex of S p or is incident to an edge between two subgraphs of S p isomorphic to S n−1 p . Explicit formulas are given for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 34 شماره
صفحات -
تاریخ انتشار 2013