Results 61 to 70 of about 413,829 (102)

Open Distance-Pattern Uniform Graphs [PDF]

, 2009
All graphs considered in this paper are finite, simple, undirected and connected. For graph theoretic terminology we refer to Harary [6].
Jose, Bibin K.
core   +1 more source

Constructing disjoint Steiner trees in Sierpiński graphs

International audienceLet be a graph and with . Then the trees in are \emph{internally disjoint Steiner trees} connecting (or -Steiner trees) if and for every pair of distinct integers , .
Klasing, Ralf, Li, Ping, Mao, Yaping, Yang, Chenxu, Cheng, Eddie   +4 more
core   +1 more source

Smarandachely t-path step signed graphs [PDF]

, 2010
Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed ...
Reddy, Siva Kota, Prashanth , B., V. Lokesha, Lokesha, V., P. Siva Kota Reddy, B. Prashanth   +5 more
core   +1 more source

The Median of Sierpinski Triangle Graphs [PDF]

The median $M$ of a graph $G$ is the set of vertices with a minimum total distance to all other vertices in the graph. In this paper, we determine the median of Sierpiński triangle graphs.
Balakrishnan, Kannan, Lekha, Divya Sindhu, Hinz, Andreas M., Dhanyamol, M V., Changat, Manoj, Koley, Hrishik   +5 more
core   +1 more source

Average height for Abelian sandpiles and the looping constant on Sierpiński graphs

For the Abelian sandpile model on Sierpiński graphs, we investigate several statistics such as average height, height probabilities and looping constant.
Sava-Huss, Ecaterina, Kaiser, Robin, Heizmann, Nico   +2 more
core   +1 more source

A 2-parametric generalization of Sierpiński gasket graphs

, 2015
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$▫.
Jakovac, Marko
core  

SierpińSki Gasket Graphs and Some of Their Properties

, 2006
The Sierpiński fractal or Sierpiński gasket ∈ is a familiar object studied by specialists in dynamical systems and probability. In this paper, we consider a graph Sn derived from the first n iterations of the process that leads to ∈, and study some of ...
Teguia, Alberto, Godbole, Anant P.
core   +1 more source

The sigma chromatic number of the Sierpinski gasket graphs and the Hanoi graphs [PDF]

, 2020
A vertex coloring c : V(G) → of a non-trivial connected graph G is called a sigma coloring if σ(u) ≠ σ(v) for any pair of adjacent vertices u and v. Here, σ(x) denotes the sum of the colors assigned to vertices adjacent to x.
Garciano, Agnes, Marcelo, Reginaldo M, Tolentino, Mark Anthony C, Ruiz, Mari-Jo P   +3 more
core  

PELABELAN TOTAL (, ) PADA GRAF SIERPIŃSKI [PDF]

, 2020
Pelabelan total (, 1) dari suatu graf sederhana adalah fungsi yang memetakan () ∪ () ke bilangan bulat sedemikian sehingga setiap dua titik yang bertetangga pada graf mendapat label yang berbeda dengan selisih paling kecil 1, setiap dua sisi yang ...
Raihanah, Cindy Rahmawati
core  

Coloring Sierpiński graphs and Sierpiński gasket graphs

, 2008
Sierpinski graphs S(n, 3) are the graphs of the Tower of Hanoi with n disks, while Sierpinski gasket graphs Sn are the graphs naturally defined by the finite number of iterations that lead to the Sierpinski gasket.
Sandi Klavžar
core