Results 1 to 10 of about 547 (79)
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
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
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
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 graphs associated to ring of Guassian integers and ring of integers modulo n
Acta Universitatis Sapientiae: Informatica, 2022 For a commutative ring R with identity 1, the zero-divisor graph of R, denoted by Γ(R), is a simple graph whose vertex set is the set of non-zero zero divisors Z*(R) and the two vertices x and y ∈ Z*(R) are adjacent if and only if xy = 0.
Pirzada S., Bhat M. Imran
doaj +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
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
Some new results on colour-induced signed graphs
Acta Universitatis Sapientiae: Informatica, 2022 A signed graph is a graph in which positive or negative signs are assigned to its edges. We consider equitable colouring and Hamiltonian colouring to obtain induced signed graphs.
Sudheer Niranjana +3 more
doaj +1 more source
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
, 2013 Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source
Metric and upper dimension of zero divisor graphs associated to commutative rings
Acta Universitatis Sapientiae: Informatica, 2020 Let R be a commutative ring with Z*(R) as the set of non-zero zero divisors. The zero divisor graph of R, denoted by Γ(R), is the graph whose vertex set is Z*(R), where two distinct vertices x and y are adjacent if and only if xy = 0.
Pirzada S., Aijaz M.
doaj +1 more source