Results 51 to 60 of about 167 (109)
Some generalizations of Sierpiński graphs
, 2013 V diplomskem delu so predstavljeni grafi Sierpińskijevega tipa, in sicer grafi Sierpińskega S(n, k), grafi trikotnikov Sierpińskega S_n, regularni grafi Sierpińskega S^+(n, k) in S^++(n, k) ter posplošeni grafi trikotnikov Sierpińskega S[n, k]. Prikazane
Šereg, Andreja
core
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
Propagating Sets in Sierpiński Fractal Graphs
A set S of black colored vertices in a graph G is called a zero forcing set of G if at every discrete time step, a black vertex with exactly one non-black vertex as its neighbour forces it to be colored black and by iteratively applying the procedure ...
Hossein Rashmanlou +2 more
core +1 more source
Optimizing the human learnability of abstract network representations. [PDF]
Proc Natl Acad Sci U S A, 2022 Qian W +5 more
europepmc +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 +4 more
core +1 more source
Mathematical modeling of multiple pathways in colorectal carcinogenesis using dynamical systems with Kronecker structure. [PDF]
PLoS Comput Biol, 2021 Haupt S +6 more
europepmc +1 more source
Packing Coloring of Some Classes of Graphs with Recursive Structure
, 2022 V doktorski disertaciji obravnavamo pakirna barvanja grafov. Ta predstavljajo eno izmed zelo raziskovanih variacij barvanj grafov. Doktorska disertacija je sestavljena iz treh delov, v sklopu katerih predstavimo rešitve različnih problemov v zvezi s ...
Ferme, Jasmina
core
Some properties of generalized Sierpiński graphs
, 2019 V magistrskem delu so obravnavane in s slikovnimi zgledi predstavljene nekatere lastnosti posplošenih grafov Sierpińskega, zgrajenih na poljubnem baznem grafu G.
Bezgovšek, Teja
core
On packing chromatic number of subcubic outerplanar graphs
, 2018 Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exists subclasses in which the packing chromatic number is finite (and small).
Holub, Přemysl +2 more
core +1 more source
The Sierpiński domination number
Let $G$ and $H$ be graphs and let $f colon V(G)rightarrow V(H)$ be a function. The Sierpiński product of $G$ and $H$ with respect to $f$, denoted by $G otimes _f H$, is defined as the graph on the vertex set $V(G)times V(H)$, consisting of $|V(G ...
Kleszcz, Elżbieta +3 more
core +1 more source