Results 71 to 80 of about 1,212,791 (104)

On odd-graceful coloring of graphs

open access: yes
For a graph G(V, E) which is undirected, simple, and finite, we denote by |V | and |E| the cardinality of the vertex set V and the edge set E of G, respectively. A graceful labeling f for the graph G is an injective function f : V → {0, 1, 2, . . . , |E|}
I. Nengah Suparta (21320564)   +3 more
core  

Odd vertex equitable even labeling of graphs

open access: yes, 2017
In this paper, we introduce a new labeling called odd vertex equitable even labeling. Let G be a graph with p vertices and q edges and A = {1, 3,..., q} if q is odd or A = {1, 3,..., q + 1} if q is even. A graph G is said to admit an odd vertex equitable
Vijayalakshmi, M.   +5 more
core   +1 more source

A PROCEDURE FOR DERIVING ODD-GRACEFUL CHROMATIC NUMBERS OF GRAPHS

open access: yes
Let \(G:=(V,E)\) be an undirected finite simple graph with vertex set \(V\) and edge set \(E\). A function \(c:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\), such that \(c(u)\neq c(v)\) for every edge \(uv\in E(G)\), is called a ...
I Nengah Suparta   +3 more
core   +1 more source

Super Fibonacci Graceful Labeling

open access: yes, 2014
: A Smarandache-Fibonacci Triple is a sequence S(n), n ≥ 0 such that S(n) = S(n−1)+S(n−2), where S(n) is the Smarandache function for integers n ≥ 0. Certainly, it is a generalization of Fibonacci sequence.
S. Navaneethakrishnan   +2 more
core  

Strong k - edge odd Graceful labeling of graphs

open access: yesInternational Mathematical Forum, 2018
openaire   +1 more source

On growth and form of animal behavior. [PDF]

open access: yesFront Integr Neurosci
Golani I, Kafkafi N.
europepmc   +1 more source

Home - About - Disclaimer - Privacy