Results 61 to 70 of about 1,134,156 (95)

Vertex-, edge-, and total-colorings of Sierpiński-like graphs

, 2006
Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the Sierpiński graphs S(n,k), graphs S + (n,k), and graphs S ++ (n,k) are considered. In particular, χ ′ ′ (Sn), χ ′ (S(n,k)), χ(S + (n,k)), χ(S ++ (n,k)), χ ′ (S + (
Marko Jakovac, Sandi Klavžar
core  

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  

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

Interacting particle systems on graphs [PDF]

, 2010
Tekmen NH. Interacting particle systems on graphs.
Tekmen, Nâzim Hikmet
core  

On the roman domination number of generalized Sierpiński graphs

, 2017
A map f : V?(0,1,2) is a Roman dominating function on a graph G = (V,E) if for every vertex v ? V with f(v)=0, there exists a vertex u, adjacent to v, such that f(u)=2. The weight of a Roman dominating function is given by f(V)=?u?V f(u).
E.D. Rodríguez-Bazan, J.A. Rodríguez-Velázquez, F. Ramezani   +2 more
core   +1 more source

Dense H-free graphs are almost (Χ(H)-1)-partite [PDF]

, 2010
By using the Szemeredi Regularity Lemma, Alon and Sudakov recently extended the classical Andrasfai-Erdos-Sos theorem to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is true.
Peter Allen, Allen, Peter
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

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  

Construction for antimagic generalized web graphs

, 2011
An antimagic labeling of a graph with q edges is a bijection from the set of edges to the set of integers {1, 2, ..., q} such that all vertex weights are pairwise distinct, where the vertex weight is the sum of labels of all edges incident with the ...
Miller, Mirka, Rylands, Leanne J. (R8511), Phanalasy, Oudone, Ryan, Joe   +3 more
core  

Independent set-based multivariate graph polynomials for fractal-type silicate triangle structures. [PDF]

Front Chem
Nithiya KS, Easwaramoorthy D.
europepmc   +1 more source