Results 11 to 20 of about 72 (71)
Fault‐Tolerant Resolvability in Some Classes of Line Graphs
Mathematical Problems in Engineering, Volume 2020, Issue 1, 2020., 2020 Fault tolerance is the characteristic of a system that permits it to carry on its intended operations in case of the failure of one of its units. Such a system is known as the fault‐tolerant self‐stable system. In graph theory, if we remove any vertex in a resolving set, then the resulting set is also a resolving set, called the fault‐tolerant ...
Xuan Guo +5 more
wiley +1 more source
On Total H-Irregularity Strength of the Disjoint Union of Graphs
Discussiones Mathematicae Graph Theory, 2020 A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and
Ashraf Faraha +5 more
doaj +1 more source
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs
Discussiones Mathematicae Graph Theory, 2021 An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f : E → {1, . . ., |E|} such that for any pair of adjacent vertices x and y, f+(x) ≠ f+(y), where the induced vertex label f+(x) = Σf(e), with e ranging ...
Lau Gee-Choon, Shiu Wai-Chee, Ng Ho-Kuen
doaj +1 more source
Zero-sum partitions of Abelian groups of order $2^n$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 The following problem has been known since the 80's. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $m_i$, $1 \leq i \leq t$, be positive integers such that $\sum_{i=1}^t m_i=m-1$.
Sylwia Cichacz, Karol Suchan
doaj +1 more source
Additive List Coloring of Planar Graphs with Given Girth
Discussiones Mathematicae Graph Theory, 2020 An additive coloring of a graph G is a labeling of the vertices of G from {1, 2, . . . , k} such that two adjacent vertices have distinct sums of labels on their neighbors.
Brandt Axel +2 more
doaj +1 more source
Bounds of Strong EMT Strength for certain Subdivision of Star and Bistar
Open Mathematics, 2018 A super edge-magic total (SEMT) labeling of a graph ℘(V, E) is a one-one map ϒ from V(℘)∪E(℘) onto {1, 2,…,|V (℘)∪E(℘) |} such that ∃ a constant “a” satisfying ϒ(υ) + ϒ(υν) + ϒ(ν) = a, for each edge υν ∈E(℘), moreover all vertices must receive the ...
Kanwal Salma +5 more
doaj +1 more source
Extension of α‐labelings of quadratic graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 11, Page 571-578, 2004., 2004 First, a new proof for the existence of an α‐labeling of the quadratic graph Q(3, 4k) is presented. Then the existence of α‐labelings of special classes of quadratic graphs with some isomorphic components is shown.
Kourosh Eshghi
wiley +1 more source
Supermagic Generalized Double Graphs 1
Discussiones Mathematicae Graph Theory, 2016 A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex.
Ivančo Jaroslav
doaj +1 more source
Applications of mathematical programming in graceful labeling of graphs
Journal of Applied Mathematics, Volume 2004, Issue 1, Page 1-8, 2004., 2004 Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper, first a new approach based on the mathematical programming technique is presented to model the ...
Kourosh Eshghi, Parham Azimi
wiley +1 more source
Constant Sum Partition of Sets of Integers and Distance Magic Graphs
Discussiones Mathematicae Graph Theory, 2018 Let A = {1, 2, . . . , tm+tn}. We shall say that A has the (m, n, t)-balanced constant-sum-partition property ((m, n, t)-BCSP-property) if there exists a partition of A into 2t pairwise disjoint subsets A1, A2, . . . , At, B1, B2, . . .
Cichacz Sylwia, Gőrlich Agnieszka
doaj +1 more source