Graphs ▫$S[n,k]$▫ are introduced as the graphs obtained from the Sierpiński graphs ▫$S(n,k)$▫ by contracting edges that lie in no triangle. The family ▫$S[n,k]$▫ is a previously studied class of Sierpiñski gasket graphs ▫$S_n$▫. Several properties of graphs ▫$S[n,k]$▫ are studied in particular, hamiltonicity and chromatic number
CombinatoricsWe study the number of spanning forests on the Sierpinski gasket SGd(n) at stage n with...
The generalized Petersen graph G(n, k), 1≤k≤n−1, is defined as follows: The graph G(n, k) has vertic...
In this thesis, we begin with a look at the Wiener Index and its correlation with the boiling point ...
Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the Sierpiń...
The Sierpiński fractal or Sierpiński gasket ∈ is a familiar object studied by specialists in dynamic...
AbstractA mapping ϕ from V(G) to {1,2,…,t} is called a path t-coloring of a graph G if each G[ϕ−1(i)...
V diplomskem delu so predstavljeni grafi Sierpińskijevega tipa, in sicer grafi Sierpińskega S(n, k),...
AbstractVertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the...
Sierpiński graphs are studied in fractal theory and have applications in diverse areas including dyn...
Motivated by a conjecture of Grunbaum and a problem of Katona, Kostochka, Pach, and Stechkin, both d...
Abstract Sierpiński graphs are extensively studied graphs of fractal nature with applications in top...
© 2017, Pleiades Publishing, Ltd. We construct an analogue of Sierpiński gasket in Lobachevskii plan...
It is well known that the Petersen graph does not contain a Hamilton cycle. In 1983 Alspach complete...
We construct an analogue of Sierpinski gasket in Lobachevskii plane by means of iterated function sy...
CombinatoricsWe study the number of connected spanning subgraphs f(d,b) (n) on the generalized Sierp...
CombinatoricsWe study the number of spanning forests on the Sierpinski gasket SGd(n) at stage n with...
The generalized Petersen graph G(n, k), 1≤k≤n−1, is defined as follows: The graph G(n, k) has vertic...
In this thesis, we begin with a look at the Wiener Index and its correlation with the boiling point ...
Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the Sierpiń...
The Sierpiński fractal or Sierpiński gasket ∈ is a familiar object studied by specialists in dynamic...
AbstractA mapping ϕ from V(G) to {1,2,…,t} is called a path t-coloring of a graph G if each G[ϕ−1(i)...
V diplomskem delu so predstavljeni grafi Sierpińskijevega tipa, in sicer grafi Sierpińskega S(n, k),...
AbstractVertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the...
Sierpiński graphs are studied in fractal theory and have applications in diverse areas including dyn...
Motivated by a conjecture of Grunbaum and a problem of Katona, Kostochka, Pach, and Stechkin, both d...
Abstract Sierpiński graphs are extensively studied graphs of fractal nature with applications in top...
© 2017, Pleiades Publishing, Ltd. We construct an analogue of Sierpiński gasket in Lobachevskii plan...
It is well known that the Petersen graph does not contain a Hamilton cycle. In 1983 Alspach complete...
We construct an analogue of Sierpinski gasket in Lobachevskii plane by means of iterated function sy...
CombinatoricsWe study the number of connected spanning subgraphs f(d,b) (n) on the generalized Sierp...
CombinatoricsWe study the number of spanning forests on the Sierpinski gasket SGd(n) at stage n with...
The generalized Petersen graph G(n, k), 1≤k≤n−1, is defined as follows: The graph G(n, k) has vertic...
In this thesis, we begin with a look at the Wiener Index and its correlation with the boiling point ...