Results 11 to 20 of about 339 (162)
EVEN SEQUENTIAL HARMONIOUS LABELING OF SOME CYCLE RELATED GRAPHS [PDF]
International Journal of Pure and Apllied Mathematics, 2014 In this paper, we generalize this result on cycles by showing that the kCn snake with string 1,1,··· ,1 when n ≡ 0(mod4) are even sequential harmonious graph. Also we show that the kC4 snake with m-pendant edges for each k,m ≥ 1, (for linear case and for general case).
P. Selvaraju +3 more
openaire +1 more source
PELABELAN HARMONIS GENAP SEJATI DARI BEBERAPA GRAF TERHUBUNG [PDF]
, 2022 Pelabelan harmonis dari graf G dengan sisi merupakan suatu pemetaan injektif dari suatu titik yang ada pada graf G ke bilangan bulat modulo sehingga setiap sisi dilabeli () + () ( ) menghasilkan label sisi yang berbeda. Graf yang dilabeli menggunakan
Rahadjeng, Budi, Taqiyah, Diyanatut
core +2 more sources
PATH AND STAR RELATED GRAPHS ON EVEN SEQUENTIAL HARMONIOUS, GRACEFUL, ODD GRACEFUL AND FELICITOUS LABELLING [PDF]
International Journal of Pure and Apllied Mathematics, 2013 In this paper, we prove that the D2(Pn) is an even sequential harmonious and graceful graph, D2(K1, n) an even sequential harmonious, graceful graph, odd graceful and felicitous graph, spl(Pn) is an even sequential harmonious and odd graceful graph, spl(K1, n) is an even sequential harmonious and felicitous graph.
P. Selvaraju, P. Balaganesan, J. Renuka
openaire +1 more source
On the edge-balanced index sets of product graphs [PDF]
, 2011 We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\times K_2$.
Krop, Elliot +2 more
core +2 more sources
Even-Odd Harmonious Labeling of Certain Family of Cyclic Graphs
International Journal of Innovative Technology and Exploring Engineering, 2020 An even-odd harmonious labeling of a graph G with p vertices and q edges is a process of assigning odd numbers 1,3,5,...,2q 1 to the vertices through a 1-1 computing function f and even numbers 0, 2, 4,..., 2( p 1) to the edges through a bijective computing function f * with the condition that f *(e uv) ( f (u) f (v))(mod 2q) where u and v are ...
M. Kalaimathi*, Dr. B. J. Balamurugan
openaire +1 more source
A new labeling construction from the -product [PDF]
, 2017 The ¿h-product that is referred in the title was introduced in 2008 as a generalization of the Kronecker product of digraphs. Many relations among labelings have been obtained since then, always using as a second factor a family of super edge-magic ...
López Masip, Susana Clara +2 more
core +4 more sources
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
, 2020 A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints, all induced ...
Dantas, Simone +2 more
core +2 more sources
Roman Domination in Complementary Prism Graphs [PDF]
, 2012 A Roman domination function on a complementary prism graph GGc is a function f : V [ V c ! {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number R(GGc) of a graph G = (V,E) is the minimum of Px2V [V c f(x)
Chaitra, V., Chaluvaraju, B.
core +2 more sources
On cordial labeling of hypertrees
, 2019 Let $f:V\rightarrow\mathbb{Z}_k$ be a vertex labeling of a hypergraph $H=(V,E)$. This labeling induces an~edge labeling of $H$ defined by $f(e)=\sum_{v\in e}f(v)$, where the sum is taken modulo $k$.
Tuczyński, Michał +2 more
core +1 more source