Results 21 to 30 of about 413,829 (102)
Strong Geodetic Problem in Networks
Discussiones Mathematicae Graph Theory, 2020 In order to model certain social network problems, the strong geodetic problem and its related invariant, the strong geodetic number, are introduced.
Manuel Paul +4 more
doaj +1 more source
Exact double domination in the generalized Sierpiński graphs [PDF]
AUT Journal of Mathematics and ComputingA subset $D$ of vertices of a simple graph $G$ is an exact double dominating set if each vertex $v$ of $G$ is dominated by exactly two vertices of $D$, i.e. $|N_G[v]\cap D|=2$, in which $N_G[v]$ is the closed neighborhood of $v$ in $G$
Mahsa Khatibi, Ali Behtoei
doaj +1 more source
Coloring Hanoi and Sierpiński graphs [PDF]
, 2012 It is shown that all Hanoi and Sierpiński graphs are in edge- and total coloring class 1, except those isomorphic to a complete graph of odd or even order, respectively.
Daniele Parisse +3 more
core +1 more source
The hamiltonicity and path t-coloring of Sierpiński-like graphs [PDF]
, 2012 A mapping ϕ from V(G) to {1,2,…,t} is called a path t-coloring of a graph G if each G[ϕ−1(i)], for 1≤i≤t, is a linear forest. The vertex linear arboricity of a graph G, denoted by vla(G), is the minimum t for which G has a path t-coloring.
Xue, Bing, Li, Guojun, Zuo, Liancui
core +1 more source
مجلة بغداد للعلومNonlinear analysis finds numerous applications in understanding the intricate characteristics of generalized Sierpinski graphs or chemical graphs. It aids in discerning the fractal patterns inherent in self-similar structures, deciphering the dynamic ...
J. Bhuvaneswari, D. Easwaramoorthy
doaj +1 more source
Security number of Sierpiński graphs
, 2023 V nalogi je najprej predstavljena terminologija in teoretične osnove potrebne za razumevanje pojmov varnosti, dominacije in varnostne dominacije v grafih. V drugem delu diplomskega dela, bomo definirali grafe Sierpińskega.
Čelan, Nika
core
Advanced Materials Interfaces, Volume 13, Issue 14, 21 July 2026.Schematic illustration of a sustainable nanofabrication process: chitosan derived from natural sources is used as a biodegradable thin film resist, patterned via Constant Pulse‐Assisted Force Lithography (CP‐AFL) to create tunable nanogrooves. These grooves template gold nanowire formation, enabling high‐resolution nanopatterning under ambient ...
Paolo Pellegrino +7 more
wiley +1 more source
Extrema property of the k-ranking of directed paths and cycles
AKCE International Journal of Graphs and Combinatorics, 2016 A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between.
Breeanne Baker Swart +3 more
doaj +1 more source
InfoScience, Volume 3, Issue 2, June 2026.Designing new polymers for applications such as sustainable plastics, biomaterials, and 3D printing has traditionally been slow and expensive, relying heavily on trial‐and‐error experiments. This review shows how polymer informatics—the integration of large polymer databases, machine‐learning models, and automated robotic synthesis—enables fast ...
Md. Saiful Islam +6 more
wiley +1 more source
Domination parameters of generalized Sierpiński graphs
AKCE International Journal of Graphs and CombinatoricsIn this paper, we obtain the Italian domination number, perfect Italian domination number and double Roman domination number of generalized Sierpiński graph [Formula: see text] where G is a cycle Cn, [Formula: see text] a complete bipartite graph ...
Jismy Varghese +2 more
doaj +1 more source