Results 11 to 20 of about 427 (193)
Even harmonious labelings of disjoint graphs with a small component
AKCE International Journal of Graphs and Combinatorics, 2015 A graph G with q edges is said to be harmonious if there is an injection f from the vertices of G to the group of integers modulo q such that when each edge xy is assigned the label f(x)+f(y)(modq), the resulting edge labels are distinct. If G is a tree,
Joseph A. Gallian, Danielle Stewart
doaj +3 more sources
Odd Harmonious Labelings of Cyclic Snakes
International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks, 2013 In [8] Liang and Bai have shown that the kC4 − snake graph is an odd harmonious graph for each k ≥ 1. In this paper we generalize this result on cycles by showing that the kCn − snake with string 1,1,…,1 when n ≡ 0 (mod 4) are odd harmonious graph.
openaire +3 more sources
AKCE International Journal of Graphs and Combinatorics, 2016 Joseph A. Gallian, Danielle Stewart
doaj +3 more sources
AKCE International Journal of Graphs and Combinatorics, 2016 Joseph A. Gallian, Danielle Stewart
doaj +3 more sources
Harmonious Labeling On Helm Graphs
Daya Matematis: Jurnal Inovasi Pendidikan Matematika, 2022 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
All trees are six-cordial [PDF]
, 2017 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
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
Mapana - Journal of Sciences, 2018 A graph G is said to be SD-harmonious labeling if there exists an injection f: V(G) -> {0,1,2,...,q} such that the induced function f*: E(G) ->{0,2,...,2q-2} defined by f(uv)=S+D (mod 2q) is bijective, where S=f(u)+f(v) and D=|f(u)-f(v)|, for every edge uv in E(G). A graph which admits SD-harmonious labeling is called SD-harmonious graph. In this
A Lourdusamy, S Jenifer Wency, F Patrick
openaire +1 more source
(Di)graph products, labelings and related results [PDF]
, 2017 Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them.
López Masip, Susana-Clara
core +4 more sources
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