Results 41 to 50 of about 208 (79)
A Study on Variants of Status Unequal Coloring in Graphs and Its Properties
Journal of Mathematics, Volume 2024, Issue 1, 2024.Let G∧ be a simple connected graph with vertex set ϑG∧ and edge set ξG∧. The status of a vertex p∈ϑG∧ is defined as ∑q≠pd(p, q). A subset P of ϑG∧ is called a status unequal dominating set (stu‐dominating set) of G∧; for every q∈ϑ−P, there exists p in P such that p and q are adjacent and st(p) ≠ st(q).
Parvathy Gnana Sambandam +4 more
wiley +1 more source
Generalized Sum List Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2019 A (graph) property 𝒫 is a class of simple finite graphs closed under isomorphisms. In this paper we consider generalizations of sum list colorings of graphs with respect to properties 𝒫.
Kemnitz Arnfried +2 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2020 Metric properties of Hanoi graphs Hnp are not as well understood as those of the closely related, but structurally simpler Sierpiński graphs Snp. The most outstanding open problem is to find the domination number of Hanoi graphs.
Hinz Andreas M., Movarraei Nazanin
doaj +1 more source
M2-Edge Colorings Of Cacti And Graph Joins
Discussiones Mathematicae Graph Theory, 2016 An edge coloring φ of a graph G is called an M2-edge coloring if |φ(v)| ≤ 2 for every vertex v of G, where φ(v) is the set of colors of edges incident with v. Let 𝒦2(G) denote the maximum number of colors used in an M2-edge coloring of G.
Czap Július +2 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2018 A total-colored graph G is rainbow total-connected if any two vertices of G are connected by a path whose edges and internal vertices have distinct colors.
Sun Yuefang, Jin Zemin, Tu Jianhua
doaj +1 more source
Pair L(2, 1)-Labelings of Infinite Graphs
Discussiones Mathematicae Graph Theory, 2019 An L(2, 1)-labeling of a graph G = (V,E) is an assignment of nonnegative integers to V such that two adjacent vertices must receive numbers (labels) at least two apart and further, if two vertices are in distance 2 then they receive distinct labels. This
Yeh Roger K.
doaj +1 more source
Global Dominator Coloring of Graphs
Discussiones Mathematicae Graph Theory, 2019 Let S ⊆ V. A vertex v ∈ V is a dominator of S if v dominates every vertex in S and v is said to be an anti-dominator of S if v dominates none of the vertices of S. Let 𝒞 = (V1, V2, . . ., Vk) be a coloring of G and let v ∈ V (G).
Hamid Ismail Sahul, Rajeswari Malairaj
doaj +1 more source
On θ-commutators and the corresponding non-commuting graphs
Open Mathematics, 2017 The θ-commutators of elements of a group with respect to an automorphism are introduced and their properties are investigated. Also, corresponding to θ-commutators, we define the θ-non-commuting graphs of groups and study their correlations with other ...
Shalchi S., Erfanian A., Farrokhi DG M.
doaj +1 more source
Irreducible No-Hole L(2, 1)-Coloring of Edge-Multiplicity-Paths-Replacement Graph
Discussiones Mathematicae Graph Theory, 2018 An L(2, 1)-coloring (or labeling) of a simple connected graph G is a mapping f : V (G) → Z+ ∪ {0} such that |f(u)−f(v)| ≥ 2 for all edges uv of G, and |f(u) − f(v)| ≥ 1 if u and v are at distance two in G.
Mandal Nibedita, Panigrahi Pratima
doaj +1 more source
Chromatic Properties of the Pancake Graphs
Discussiones Mathematicae Graph Theory, 2017 Chromatic properties of the Pancake graphs Pn, n ⩾ 2, that are Cayley graphs on the symmetric group Symn generated by prefix-reversals are investigated in the paper.
Konstantinova Elena
doaj +1 more source