Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Skolem Odd Vertex Graceful Signed Graphs for Path
View through CrossRef
In this article, the new concept skolem odd vertex graceful signed graphs on directed graphs have been introduced. A graph G(P, m, n) is a bijective function f:V(G) {1, 3, 5, 7, …, 2p-1} such that, when each edge uv E(G) is assigned by f(uv) = f(v) -f(u) the positive edges receive distinct labels from the set {1, 3, 5, …, 2m-1} and the negative edges receive distinct labels from the set {-1, -3, -5, -6, ..., -2n-1}, it is called as a skolem odd vertex graceful signed graphs. In this article, Path graph is investigated under skolem odd vertex graceful labeling for signed graph.
Title: Skolem Odd Vertex Graceful Signed Graphs for Path
Description:
In this article, the new concept skolem odd vertex graceful signed graphs on directed graphs have been introduced.
A graph G(P, m, n) is a bijective function f:V(G) {1, 3, 5, 7, …, 2p-1} such that, when each edge uv E(G) is assigned by f(uv) = f(v) -f(u) the positive edges receive distinct labels from the set {1, 3, 5, …, 2m-1} and the negative edges receive distinct labels from the set {-1, -3, -5, -6, .
, -2n-1}, it is called as a skolem odd vertex graceful signed graphs.
In this article, Path graph is investigated under skolem odd vertex graceful labeling for signed graph.
Related Results
Some results on skolem odd difference mean labeling
Some results on skolem odd difference mean labeling
Let G = (V, E) be a graph with p vertices and q edges. A graph G is said to be skolem odd difference mean if there exists a function f : V(G) → {0, 1, 2, 3,...,p+3q — 3} satisfying...
Pelabelan skolem graceful pada graf (S_n,r)
Pelabelan skolem graceful pada graf (S_n,r)
Pelabelan pada suatu graph adalah pemetaan yang memetakan unsur-unsur graph yaitu himpunan titik, himpunan sisi, maupun himpunan titik dan sisi ke suatu bilangan asli dengan aturan...
Extended-Interval Aminoglycoside Administration for Children: A Meta-analysis
Extended-Interval Aminoglycoside Administration for Children: A Meta-analysis
Background. There has been a long-standing debate regarding whether aminoglycosides should be administered on a multiple daily dosing (MDD) or once-daily dosing (ODD) schedule. Sev...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Skolem, Thoralf (1887–1963)
Skolem, Thoralf (1887–1963)
The twentieth-century mathematician Thoralf Skolem is known principally for two achievements. The first is the statement and proof of the Löwenheim-Skolem theorem. The second is hi...
Paley, Cubic Paley, Quadruple Paley, and Generalized Paley Graphs with an Edge-Graceful Labeling
Paley, Cubic Paley, Quadruple Paley, and Generalized Paley Graphs with an Edge-Graceful Labeling
The Paley graph Pq is a simple connected strongly regular graph with (q, q−1/2 , q−5/4 , q−1/4 ) as its parameters, where V (Pq) is the finite field Fq of order q = pn, p is an odd...