Results 21 to 30 of about 507 (84)
On Generalized Sierpiński Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we obtain closed formulae for several parameters of generalized Sierpiński graphs S(G, t) in terms of parameters of the base graph G. In particular, we focus on the chromatic, vertex cover, clique and domination numbers.
Rodríguez-Velázquez Juan Alberto +2 more
doaj +1 more source
Blast-Transition Domination for the -∂ Obrazom of Zero Divisor Graph over Ring Zn
International Journal of Engineering and Advanced Technology, 2019 The hub of this article is a search on the behavior of the blast domination and the blast transition domination for the obrazom of zero divisor graphs.AMS Subject Classification: 13A99, 13M99, 05C76, 05C69.
semanticscholar +1 more source
The general position problem and strong resolving graphs
Open Mathematics, 2019 The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
Klavžar Sandi, Yero Ismael G.
doaj +1 more source
3-Tuple Total Domination Number of Rook’s Graphs
Discussiones Mathematicae Graph Theory, 2022 A k-tuple total dominating set (kTDS) of a graph G is a set S of vertices in which every vertex in G is adjacent to at least k vertices in S. The minimum size of a kTDS is called the k-tuple total dominating number and it is denoted by γ×k,t(G).
Pahlavsay Behnaz +2 more
doaj +1 more source
Bounding the Open k-Monopoly Number of Strong Product Graphs
Discussiones Mathematicae Graph Theory, 2018 Let G = (V, E) be a simple graph without isolated vertices and minimum degree δ, and let k ∈ {1 − ⌈δ/2⌉, . . . , ⌊δ/2⌋} be an integer. Given a set M ⊂ V, a vertex v of G is said to be k-controlled by M if δM(v)≥δG(v)2+k$\delta _M (v) \ge {{\delta _G (v)}
Kuziak Dorota +2 more
doaj +1 more source
Protection of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2022 In this paper, we study the weak Roman domination number and the secure domination number of lexicographic product graphs. In particular, we show that these two parameters coincide for almost all lexicographic product graphs. Furthermore, we obtain tight
Klein Douglas J. +1 more
doaj +1 more source
The upper bounds for multiplicative sum Zagreb index of some graph operations
, 2017 Let G be a simple graph with vertex set V(G) and edge set E(G). In [7], Eliasi et al. introduced the multiplicative sum Zagreb index of a graph G which is denoted by Π1(G) and is defined by Π1(G) = ∏ uv∈V (G) (dG(u)+dG(v)) .
Yasar Nacaroglu, A. D. Maden
semanticscholar +1 more source
Graph Exponentiation and Neighborhood Reconstruction
Discussiones Mathematicae Graph Theory, 2021 Any graph G admits a neighborhood multiset 𝒩(G) = {NG(x) | x ∈ V (G)} whose elements are precisely the open neighborhoods of G. We say G is neighborhood reconstructible if it can be reconstructed from 𝒩(G), that is, if G ≅ H whenever 𝒩 (G) = 𝒩(H) for ...
Hammack Richard H.
doaj +1 more source
The General Position Problem on Kneser Graphs and on Some Graph Operations
Discussiones Mathematicae Graph Theory, 2021 A vertex subset S of a graph G is a general position set of G if no vertex of S lies on a geodesic between two other vertices of S. The cardinality of a largest general position set of G is the general position number (gp-number) gp(G) of G.
Ghorbani Modjtaba +5 more
doaj +1 more source
Some variants of the Szeged index under rooted product of graphs
, 2017 The Szeged index S ́.G/ of a connected graph G is defined as the sum of the terms nu.ejG/nv.ejG/ over all edges e D uv of G, where nu.ejG/ is the number of vertices of G lying closer to u than to v and nv.ejG/ is the number of vertices of G lying closer ...
M. Azari
semanticscholar +1 more source