Results 1 to 10 of about 81 (79)
Divided square difference cordial Labeling of join some spider graphs [PDF]
E3S Web of Conferences, 2023 Let G be a graph with its vertices and edges. On defining bijective function ρ:V(G) →{0,1,...,p}. For each edge assign the label with 1 if ρ*(ab)= | ρ(a)2−ρ(b)2/ρ(a)−ρ(b) | is odd or 0 otherwise such that |eρ(1) − eρ(0)| ≤ 1 then the labeling is called ...
Christy T., Palani G.
doaj +2 more sources
AKCE International Journal of Graphs and CombinatoricsFor a nontrivial graph G, a subset labeling of G is a labeling of the vertices of G with nonempty subsets of the set [Formula: see text] for a positive integer r such that two vertices of G have disjoint labels if and only if the vertices are adjacent ...
Gary Chartrand
exaly +3 more sources
Supermagic Graphs with Many Different Degrees
Discussiones Mathematicae Graph Theory, 2021 Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f from the set of edges E to a set of consecutive integers {a, a + 1, . . .
Kovář Petr +3 more
doaj +1 more source
On L(2, 1)-Labelings of Oriented Graphs
Discussiones Mathematicae Graph Theory, 2022 We extend a result of Griggs and Yeh about the maximum possible value of the L(2, 1)-labeling number of a graph in terms of its maximum degree to oriented graphs.
Colucci Lucas, Győri Ervin
doaj +1 more source
On Edge H-Irregularity Strengths of Some Graphs
Discussiones Mathematicae Graph Theory, 2021 For a graph G an edge-covering of G is a family of subgraphs H1, H2, . . . , Ht such that each edge of E(G) belongs to at least one of the subgraphs Hi, i = 1, 2, . . . , t. In this case we say that G admits an (H1, H2, . . . , Ht)-(edge) covering.
Naeem Muhammad +4 more
doaj +1 more source
Trees Whose Even-Degree Vertices Induce a Path are Antimagic
Discussiones Mathematicae Graph Theory, 2022 An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . ., |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels assigned to edges incident to v.
Lozano Antoni +3 more
doaj +1 more source
PELABELAN ODD-GRACEFUL PADA GRAF PRODUK SISIR
Majalah Ilmiah Matematika dan Statistika, 2022 Gnanajothi defined a graph with edges to be odd-graceful if there is an injective function such that if every edge is labelled with the resulting edge labels are . She proved that the graph obtained by joining one pendant to every vertex in is odd-
Juan Daniel +3 more
doaj +1 more source
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
SEMT valuation and strength of subdivided star of K 1,4
Open Mathematics, 2020 This study focuses on finding super edge-magic total (SEMT) labeling and deficiency of imbalanced fork and disjoint union of imbalanced fork with star, bistar and path; in addition, the SEMT strength for Imbalanced Fork is investigated.
Kanwal Salma +6 more
doaj +1 more source
Mathematics Subject Classification interrater agreement dataset
, 2022 The Mathematics Subject Classification organizes Publications, Software, and Research Data into a hierarchical classification scheme maintained by MathSciNet (mr) and zbMATH Open (zbmath). According to the classification scheme, both organizations mr and
Olaf Teschke +2 more
core +1 more source