Results 1 to 10 of about 746 (100)

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, Zeveliano Zidane Barack, Pandu Setya Ilham, Kiki Ariyanti Sugeng   +3 more
doaj   +2 more sources

The local vertex anti-magic coloring for certain graph operations. [PDF]

Heliyon
Uma L, Rajasekaran G.
europepmc   +2 more sources

Growable realizations: a powerful approach to the Buratti-Horak-Rosa Conjecture [PDF]

Ars Math. Contemp., 2021
Label the vertices of the complete graph Kv with the integers {0, 1, . . . , v − 1} and define the length of the edge between x and y to be min(|x−y|, v−|x−y|). Let L be a multiset of size v − 1 with underlying set contained in {1, . . . , bv/2c}.
M. A. Ollis, A. Pasotti, M. Pellegrini, John R. Schmitt   +3 more
semanticscholar   +1 more source

l-HILBERT MEAN LABELING OF SOME PATH RELATED GRAPHS

Tuijin Jishu/Journal of Propulsion Technology, 2023
Let  be a graph with  vertices and  edges.  The th hilbert number is denoted by  and is defined by   where   A - hilbert mean labeling is an injective function , where that induces a bijection  defined by for all .  A graph which admits such labeling is
R. Pappathi, M. P. Syed Ali Nisaya
semanticscholar   +1 more source

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, Kravčenko Michal, Silber Adam, Krbeček Matěj   +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, Siddiqui Muhammad Kamran, Bača Martin, Semaničová-Feňovčíková Andrea, Ashraf Faraha   +4 more
doaj   +1 more source

Vertex Magic Labeling On V_4 for Cartesian product of two cycles

, 2021
Let V4 be an abelian group under multiplication. Let g: E(G) → V4. Then the vertex magic labeling on V4 is induced as g : V(G) → V4 such that g (v) = ∏ g(uv) u where the product is taken over all edges uv of G incident at v is constant.
V. A. Mary
semanticscholar   +1 more source

Total and Strong Edge Colorings on Human Chain Network

, 2021
In this paper, we have determined total chromatic and strong chromatic index of human chain network.
J. Kavitha, K. Anitha
semanticscholar   +1 more source

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   +1 more source