Results 11 to 20 of about 17,946 (257)
Even-Odd Prime Harmonious Graphs [PDF]
The paper considers finite and undirected simple connected graphs. Usually, graph labeling is an assignment of integers to the vertices or edges in the method.
Dr R. S. Ramkumar
doaj
Harmonious graphs from α-trees
Two of the most studied graph labelings are the types of harmonious and graceful. A harmonious labeling of a graph of size m and order n, is an injective assignment of nonnegative integers smaller than m, such that the weights of the edges, which are ...
Christian Barrientos, Sarah Minion
doaj +1 more source
Harmonious Labeling On Helm Graphs
graph consists of two sets, namely vertices and edges , which are sets that cannot be empty. The helmet graph is obtained from graph circle with addition side pendants with notation . Something graph side is said to be harmonious if there is an injective function that produces function labeling side which will result in a different sided label. In
Husnul Hatima, Nurdin Hinding, Muh Nur
openaire +1 more source
Harmonious Labelings Via Cosets and Subcosets
In [Abueida, A. and Roblee, K., More harmonious labelings of families of disjoint unions of an odd cycle and certain trees, J. Combin. Math. Combin. Comput., 115 (2020), 61-68] it is shown that the disjoint union of an odd cycle and certain paths is harmonious, and that certain starlike trees are harmonious using properties of cosets for a particular ...
Painter, Jared L +2 more
openaire +3 more sources
Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4)
A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by f*(uv)=f(u)+f(v) is a bijection.Here we show that graphs constructed by edge comb product of ...
Sabrina Shena Sarasvati +2 more
doaj +1 more source
The Odd Harmonious Labeling on Variation of the Double Quadrilateral Windmill Graphs
A Graphis calledif it hasvertices and edqes. The graphis said to be an odd harmonious if there exists an injectionsuch that induced mappingis a bijection and is said to be an odd harmonious labeling of.
Fery Firmansah
doaj +1 more source
All trees are six-cordial [PDF]
For any integer $k>0$, a tree $T$ is $k$-cordial if there exists a labeling of the vertices of $T$ by $\mathbb{Z}_k$, inducing a labeling on the edges with edge-weights found by summing the labels on vertices incident to a given edge modulo $k$ so that ...
Driscoll, Keith +2 more
core +2 more sources
ℤ2 × ℤ2-Cordial Cycle-Free Hypergraphs
Hovey introduced A-cordial labelings as a generalization of cordial and harmonious labelings [7]. If A is an Abelian group, then a labeling f : V (G) → A of the vertices of some graph G induces an edge labeling on G; the edge uv receives the label f(u) +
Cichacz Sylwia +2 more
doaj +1 more source
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source
Near―perfect non-crossing harmonic matchings in randomly labeled points on a circle [PDF]
Consider a set $S$ of points in the plane in convex position, where each point has an integer label from $\{0,1,\ldots,n-1\}$. This naturally induces a labeling of the edges: each edge $(i,j)$ is assigned label $i+j$, modulo $n$.
József Balogh +2 more
doaj +1 more source

