Log in

Relevant bibliographies by topics / Graceful graphs / Journal articles

To see the other types of publications on this topic, follow the link: Graceful graphs.

Journal articles on the topic 'Graceful graphs'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Graceful graphs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Samarakoon Bathwadana Ralalage, Dinushi Dhananjalee, and Ekanayake Mudiyanselage Uthpala Senarath Bandara Ekanayake. "An Effective Method of Graceful Labeling for Pendant Graphs." International Journal of Integrative Sciences 3, no. 9 (2024): 1035–52. http://dx.doi.org/10.55927/ijis.v3i9.10487.

Full text

Abstract:

This study focuses on the significant branch of graph theory known as graceful labeling, which involves assigning integers to the vertices and edges of graphs. Various techniques, such as vertex-graceful, edge-graceful, harmonious, lucky, magic, and prime labeling, have been developed to address this problem. Despite the extensive research on graceful labeling, the specific challenge of labeling pendant graphs gracefully has not been widely explored. Our research proposes new algorithms for gracefully labeling graphs with pendant vertices. These algorithms can be applied to various types of gr

APA, Harvard, Vancouver, ISO, and other styles

2

V, Akshaya, and Asha S. "Even Triangular Graceful Number o n Special Graphs." Indian Journal of Science and Technology 16, no. 48 (2023): 4648–56. https://doi.org/10.17485/IJST/v16i48.2036.

Full text

Abstract:

Abstract <strong>Objectives:</strong> To explore and detect some new types of graphs that exhibit even triangular graceful labeling. <strong>Methods:</strong> The methodology entails developing a mathematical formulation for labeling a given graph's vertices and demonstrating that these formulations result in Even triangular graceful labeling.<strong> Findings:</strong> Here we describe even triangular graceful labeling which is a new version of triangular graceful labeling. In the present paper, we establish even triangular graceful labeling for multi-star graph .&nbs

APA, Harvard, Vancouver, ISO, and other styles

3

Makadia, H. M., H. M. Karavadiya, and V. J. Kaneria. "Graceful centers of graceful graphs and universal graceful graphs." Proyecciones (Antofagasta) 38, no. 2 (2019): 305–14. http://dx.doi.org/10.4067/s0716-09172019000200305.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Makadia, H. M., H. M. Karavadiya, and V. J. Kaneria. "Graceful centers of graceful graphs and universal graceful graphs." Proyecciones (Antofagasta) 38, no. 2 (2019): 305–14. https://doi.org/10.22199/issn.0717-6279-3574.

Full text

Abstract:

In this paper we define graceful center of a graceful graph. We proved any graph G which admits α-labeling has at least four graceful centers. We also defined a new strong concept of universal graceful graph. Some results on ring sum of two graphs for their graceful labeling are proved.

APA, Harvard, Vancouver, ISO, and other styles

5

Eshghi, Kourosh, and Parham Azimi. "Applications of mathematical programming in graceful labeling of graphs." Journal of Applied Mathematics 2004, no. 1 (2004): 1–8. http://dx.doi.org/10.1155/s1110757x04310065.

Full text

Abstract:

Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper, first a new approach based on the mathematical programming technique is presented to model the graceful labeling problem. Then a branching method is developed to solve the problem for special classes of graphs. Computational results show the efficiency of the proposed algorithm for different classes of graphs. One of the interesting results

APA, Harvard, Vancouver, ISO, and other styles

6

M., Soundharya, and Balakumar R. "GRACEFUL AND GRACEFUL LABELING OF GRAPHS." International Journal of Applied and Advanced Scientific Research 3, no. 2 (2018): 23–27. https://doi.org/10.5281/zenodo.1407349.

Full text

Abstract:

The concept of a graph labeling is an active area of research in graph theory which has rigorous applications in coding theory, communication networks, optimal circuits layouts and graph decomposition problems.Graph labeling were first introduced in the late 1960s and have been motivated by practical problems. In the intervening years variety of graph labeling techniques have been studied and the subject is growing exponentially.

APA, Harvard, Vancouver, ISO, and other styles

7

R., Jebesty Shajila, and Vimala S. "Graceful Labelling for Complete Bipartite Fuzzy Graphs." British Journal of Mathematics & Computer Science 22, no. 2 (2017): 1–9. https://doi.org/10.9734/BJMCS/2017/32242.

Full text

Abstract:

The concept of fuzzy graceful labelling is introduced. A graph which admits a fuzzy graceful labelling is called a fuzzy graceful graph. Fuzzy graceful labelled graphs are becoming an increasingly useful family of mathematical models for a broad range of applications. In this paper the concept of fuzzy graceful labelling is applied to complete bipartite graphs. Also we discussed the edge and vertex gracefulness of some complete bipartite graphs.

APA, Harvard, Vancouver, ISO, and other styles

8

G. Marimuthu and P. Krishnaveni. "Super edge-antimagic graceful labeling of graphs." Malaya Journal of Matematik 3, no. 03 (2015): 312–17. http://dx.doi.org/10.26637/mjm303/010.

Full text

Abstract:

For a graph $G=(V, E)$, a bijection $g$ from $V(G) \cup E(G)$ into $\{1,2, \ldots,|V(G)|+|E(G)|\}$ is called $(a, d)$-edge-antimagic graceful labeling of $G$ if the edge-weights $w(x y)=|g(x)+g(y)-g(x y)|, x y \in E(G)$, form an arithmetic progression starting from $a$ and having a common difference $d$. An $(a, d)$-edge-antimagic graceful labeling is called super $(a, d)$-edge-antimagic graceful if $g(V(G))=\{1,2, \ldots,|V(G)|\}$. Note that the notion of super $(a, d)$-edge-antimagic graceful graphs is a generalization of the article "G. Marimuthu and $\mathrm{M}$. Balakrishnan, Super edge m

APA, Harvard, Vancouver, ISO, and other styles

9

Tharmaraj, T., and P. B. Sarasija. "Square Graceful Graphs." International Journal of Mathematics and Soft Computing 4, no. 1 (2014): 129. http://dx.doi.org/10.26708/ijmsc.2014.1.4.15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kaneria, V. J., H. M. Makadia, and Meera Meghapara. "Some Graceful Graphs." International Journal of Mathematics and Soft Computing 4, no. 2 (2014): 165. http://dx.doi.org/10.26708/ijmsc.2014.2.4.17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Acharya, B. D., and K. A. Germina. "Vertex-graceful graphs." Journal of Discrete Mathematical Sciences and Cryptography 13, no. 5 (2010): 453–63. http://dx.doi.org/10.1080/09720529.2010.10698307.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Harary, Frank, and D. Frank Hsu. "Node-graceful graphs." Computers & Mathematics with Applications 15, no. 4 (1988): 291–98. http://dx.doi.org/10.1016/0898-1221(88)90214-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Acharya, Mukti, and Tarkeshwar Singh. "Graceful Signed Graphs." Czechoslovak Mathematical Journal 54, no. 2 (2004): 291–302. http://dx.doi.org/10.1023/b:cmaj.0000042369.18091.15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Liu, Xin Sheng, Yuan Yuan Liu, Bing Yao, and Yan Gou. "Labelling Properties of Special Models Related with Networks." Advanced Materials Research 734-737 (August 2013): 2974–77. http://dx.doi.org/10.4028/www.scientific.net/amr.734-737.2974.

Full text

Abstract:

In the past few years many scientists have tried to develop models of networks and to investigate the mechanisms that determine the topology of complex networks. We define a class of graphs called (k,m)-dragon graphs and uniformly (k,m)-dragon graphs as referenced models of complex networks. These dragon graphs have some properties such as its admits (k,d)-odd-graceful labeling, graceful labellings, odd-graceful labellings and so on. In this paper, we proposed and defined the notion of some labelings of dragon graphs, the odd-graceful, graceful and total labellings of edges magic of these drag

APA, Harvard, Vancouver, ISO, and other styles

15

Haviar, Miroslav, and Katarina Kotuľová. "Characterizations of kites as graceful graphs." Cubo (Temuco) 26, no. 3 (2024): 367–86. http://dx.doi.org/10.56754/0719-0646.2603.367.

Full text

Abstract:

We introduce and study an infinite family of graceful graphs, which we call kites. The kites are graphs where a path is joined with a graph "forming" a kite. We study and characterize three classes of the kites: kites formed by cycles known to be graceful, fan kites and lantern kites. Beside showing in a transparent way that all these graphs are graceful, we provide characterizations of these graphs among all simple graphs via three tools: via Sheppard's labelling sequences introduced in the 1970s and via labelling relations and graph chessboards. The latter are relatively new tools for the st

APA, Harvard, Vancouver, ISO, and other styles

16

P, Sumathi, and Geetha Ramani G. "Arithmetic Sequential Graceful Labeling on Star Related Graphs." Indian Journal of Science and Technology 15, no. 44 (2022): 2356–62. https://doi.org/10.17485/IJST/v15i44.1863.

Full text

Abstract:

Abstract <strong>Objectives:</strong> To identify a new family of Arithmetic sequential graceful graphs. <strong>Methods:</strong> The methodology involves mathematical formulation for labeling of the vertices of a given graph and subsequently establishing that these formulations give rise to arithmetic sequential graceful labeling. <strong>Findings:</strong> In this study, we analyzed some star related graphs namely Star graph, Ustar, t-star, and double star proved that these graphs possess Arithmetic sequential graceful labeling. <strong>Novelty:</strong> H

APA, Harvard, Vancouver, ISO, and other styles

17

Deshmukh, Ujwala Nilkanth. "Graceful and Odd Graceful Labeling of Graphs." International Journal of Mathematics and Soft Computing 6, no. 2 (2016): 13. http://dx.doi.org/10.26708/ijmsc.2016.2.6.02.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

V. J. Kaneria, M. M. Jariya, and H. M. Makadia. "Graceful labeling of arrow graphs and double arrow graphs." Malaya Journal of Matematik 3, no. 04 (2015): 382–86. http://dx.doi.org/10.26637/mjm304/002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Zeen El Deen, Mohamed R., and Nora A. Omar. "Extending of Edge Even Graceful Labeling of Graphs to Strong r -Edge Even Graceful Labeling." Journal of Mathematics 2021 (April 2, 2021): 1–19. http://dx.doi.org/10.1155/2021/6643173.

Full text

Abstract:

Edge even graceful labeling of a graph G with p vertices and q edges is a bijective f from the set of edge E G to the set of positive integers 2,4 , … , 2 q such that all the vertex labels f ∗ V G , given by f ∗ u = ∑ u v ∈ E G f u v mod 2 k , where k = max p , q , are pairwise distinct. There are many graphs that do not have edge even graceful labeling, so in this paper, we have extended the definition of edge even graceful labeling to r -edge even graceful labeling and strong r -edge even graceful labeling. We have obtained the necessary conditions for more path-related graphs and cycle-rela

APA, Harvard, Vancouver, ISO, and other styles

20

Gobind, Mohanty, Mishra Debdas, Sarangi Pravat, and Bhattacharjee Subarna. "Some New Classes of (k, d) Graceful 3 Distance Trees and 3 Distance Unicyclic Graphs." Indian Journal of Science and Technology 15, no. 14 (2022): 630–39. https://doi.org/10.17485/IJST/v15i14.254.

Full text

Abstract:

Abstract <strong>Objectives:</strong> To identify a new family of (k; d) graceful graphs. <strong>Methods :</strong> The methodology involves mathematical formulation for labeling of the vertices of a given graph and subsequently establishing that these formulations give rise to (k;d) graceful labeling. <strong>Findings:</strong> Here we define a three-distance tree as the tree possessing a path such that each vertex of the tree is at most at a distance three from that path. In this paper we identify two families of three distance trees that possess (k; d) graceful lab

APA, Harvard, Vancouver, ISO, and other styles

21

M. Keerthika. "Prime Graceful Chromatic Number of Diverse Graphs." Communications on Applied Nonlinear Analysis 31, no. 6s (2024): 259–67. http://dx.doi.org/10.52783/cana.v31.1220.

Full text

Abstract:

In this paper, prime graceful coloring is introduced which aims to incorporate principles of prime and graceful coloring. The prime graceful coloring of star, path, cycle, friendship, pan and bistar graphs are proposed. This new approach is related to the prime graceful chromatic number which represent the fewest colors needed to color any graph adhering to the principles of prime graceful coloring. Also, the efficiency of new coloring are analyzed with the examples.

APA, Harvard, Vancouver, ISO, and other styles

22

Kamaraj, T., and J. Thangakani. "Edge even and edge odd graceful labelings of Paley Graphs." Journal of Physics: Conference Series 1770, no. 1 (2021): 012068. http://dx.doi.org/10.1088/1742-6596/1770/1/012068.

Full text

Abstract:

Abstract Edge even graceful labeling is a novel graceful labelling, introduced in 2017 by Elsonbaty and Daoud. A graph G with p vertices and q edges is called an edge even graceful if there is a bijection f: E(G) → {2, 4,. . ., 2q} such that, when each vertex is assigned the sum of the labels of all edges incident to it mod 2k, where k = max (p, q), the resulting vertex labels are distinct. A labeling of G is called edge odd graceful labeling, if there exists a bijection f from the set of edges E(G) to the set {1,3,5,…,2q-1} such that the induced the map f* from the set of vertices V(G) to {0,

APA, Harvard, Vancouver, ISO, and other styles

23

Vaidya, S. K., and N. H. Shah. "Graceful and Odd Graceful Labeling of Some Graphs." International Journal of Mathematics and Soft Computing 3, no. 1 (2013): 61. http://dx.doi.org/10.26708/ijmsc.2013.1.3.07.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Uma Maheswari, S., and K. Indirani. "Prime Difference Speed Sequence Graceful Graphs." International Journal of Scientific Engineering and Research 5, no. 1 (2017): 75–79. https://doi.org/10.70729/ijser151192.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Aljohani, Mohammed, and Salama Nagy Daoud. "The Edge Odd Graceful Labeling of Water Wheel Graphs." Axioms 14, no. 1 (2024): 5. https://doi.org/10.3390/axioms14010005.

Full text

Abstract:

A graph, G=(V,E), is edge odd graceful if it possesses edge odd graceful labeling. This labeling is defined as a bijection g:E(G)→{1,3,…,2m−1}, from which an injective transformation is derived, g*:V(G)→{1,2,3,…,2m−1}, from the rule that the image of u∈V(G) under g* is ∑uv∈E(G)g(uv)mod(2m). The main objective of this manuscript is to introduce new classes of planar graphs, namely water wheel graphs, WWn; triangulated water wheel graphs, TWn; closed water wheel graphs, CWn; and closed triangulated water wheel graphs, CTn. Furthermore, we specify conditions for these graphs to allow for edge odd

APA, Harvard, Vancouver, ISO, and other styles

26

Vaidya, S. K., and Lekha Bijukumar. "Some New Graceful Graphs." International Journal of Mathematics and Soft Computing 1, no. 1 (2011): 37. http://dx.doi.org/10.26708/ijmsc.2011.1.1.05.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Tharmaraj, T., and P. B. Sarasija. "Some Square Graceful Graphs." International Journal of Mathematics and Soft Computing 5, no. 1 (2015): 119. http://dx.doi.org/10.26708/ijmsc.2015.1.5.14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Niedzialomski, Amanda. "Radio graceful Hamming graphs." Discussiones Mathematicae Graph Theory 36, no. 4 (2016): 1007. http://dx.doi.org/10.7151/dmgt.1910.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Murugesan, N., and R. Uma. "Super Vertex Graceful Graphs." Communications on Applied Electronics 6, no. 9 (2017): 38–42. http://dx.doi.org/10.5120/cae2017652560.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Lavanya, Y., Dhanyashree, and K. N. Meera. "Radio Mean Graceful Graphs." Journal of Physics: Conference Series 1172 (March 2019): 012071. http://dx.doi.org/10.1088/1742-6596/1172/1/012071.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Acharya, Mukti, and Tarkeshwar Singh. "Skolem Graceful Signed Graphs." Electronic Notes in Discrete Mathematics 15 (May 2003): 10–11. http://dx.doi.org/10.1016/s1571-0653(04)00508-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Lee, S. M., and S. C. Shee. "On skolem graceful graphs." Discrete Mathematics 93, no. 2-3 (1991): 195–200. http://dx.doi.org/10.1016/0012-365x(91)90255-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Meera, K. N. "Radio Geometric graceful graphs." IOP Conference Series: Materials Science and Engineering 577 (December 7, 2019): 012167. http://dx.doi.org/10.1088/1757-899x/577/1/012167.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Bloom, G. S., and D. F. Hsu. "On Graceful Directed Graphs." SIAM Journal on Algebraic Discrete Methods 6, no. 3 (1985): 519–36. http://dx.doi.org/10.1137/0606051.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Solairaju, A., and K. Chithra. "Edge - Odd Graceful Graphs." Electronic Notes in Discrete Mathematics 33 (April 2009): 15–20. http://dx.doi.org/10.1016/j.endm.2009.03.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Subbiah, S. P., J. Pandimadevi, and R. Chithra. "Super total graceful graphs." Electronic Notes in Discrete Mathematics 48 (July 2015): 301–4. http://dx.doi.org/10.1016/j.endm.2015.05.045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

D. Amuthavalli, O. V. Shanmuga Sundaram. "Super fibonacci graceful anti – magic labeling for flower graphs and python coding." Tuijin Jishu/Journal of Propulsion Technology 44, no. 3 (2023): 3407–12. http://dx.doi.org/10.52783/tjjpt.v44.i3.2049.

Full text

Abstract:

A graph vertices and edges. A super fibonacci graceful anti-magic labeling of is an injective function such that the induced edge labeling is a bijection onto the set In addition, all the vertex sums are pairwise distinct and all the edges are unique. If a graph admits a super fibonacci graceful anti magic labeling then is called super fibonacci graceful anti- magic graph In this article the concept of super fibonacci graceful anti- magic labeling is introduced and investigated with some flower graphs. These graphs are called super fibonacci graceful anti magic graph .

APA, Harvard, Vancouver, ISO, and other styles

38

Semenyuta, Marina F. "FIBONACCI AND SUPER FIBONACCI GRACEFUL LABELLINGS OF SOME TYPES OF GRAPHS." Journal of Automation and Information sciences 1 (January 1, 2021): 105–21. http://dx.doi.org/10.34229/0572-2691-2021-1-10.

Full text

Abstract:

We consider the basic theoretical information regarding the Fibonacci graceful graphs. An injective function is said a Fibonacci graceful labelling of a graph of a size , if it induces a bijective function on the set of edges , where by the rule , for any adjacent vertices A graph that allows such labelling is called Fibonacci graceful. In this paper, we introduce the concept of super Fibonacci graceful labelling, narrowing the set of vertex labels, i.e. Four types of problems to be studied are selected. In the problem of the first type, the following question is raised: is there a graph that

APA, Harvard, Vancouver, ISO, and other styles

39

V J Kaneria, H P Chudasama, and P P Andharia. "Absolute Mean Graceful Labeling in Path Union of Various Graphs." Mathematical Journal of Interdisciplinary Sciences 7, no. 1 (2018): 51–56. http://dx.doi.org/10.15415/mjis.2018.71008.

Full text

Abstract:

Present paper aims to focus on absolute mean graceful labeling in path union of various graphs. We proved path union of graphs like tree, path Pn, cycle Cn, complete bipartite graph Km, n, grid graph PM × Pn, step grid graph Stn and double step grid graph DStn are absolute mean graceful graphs.

APA, Harvard, Vancouver, ISO, and other styles

40

Asy’ari, M. L., Dafik, I. H. Agustin, R. Nisviasari, and R. Adawiyah. "On graceful chromatic number of some graphs." Journal of Physics: Conference Series 2157, no. 1 (2022): 012013. http://dx.doi.org/10.1088/1742-6596/2157/1/012013.

Full text

Abstract:

Abstract We examine that all graphs in this paper are limited, simple and connected. A graceful k-coloring of a graph is a proper vertex coloring f 1 : V (G) → {1, 2,…, k} where k ≥ 2 which induces a proper edge coloring f 2 : E (G) → {1, 2,…, k − 1} characterized by f 2(uυ) = |f 1(u) — f 2 (υ)|. Nethermost k for which a graph G has a graceful k-coloring is named a graceful chromatic number of a graph G, denoted by χg (G). In our research, we will obtain the exact value of the graceful chromatic number of some graphs.

APA, Harvard, Vancouver, ISO, and other styles

41

Santhakumaran, A. P., and P. Balaganesan. "Vertex graceful labeling of some classes of graphs." Proyecciones (Antofagasta) 37, no. 1 (2018): 19–43. https://doi.org/10.22199/issn.0717-6279-2778.

Full text

Abstract:

A connected graph G = (V, E) of order atleast two, with order p and size q is called vertex-graceful if there exists a bijection f : V → {1, 2, 3, ··· p} such that the induced function f * : E → {0, 1, 2, ··· q - 1} defined by f * (uv) = (f(u) + f(v))(mod q) is a bijection. The bijection f is called a vertex-graceful labeling of G. A subset S of the set of natural numbers N is called consecutive if S consists of consecutive integers. For any set X, a mapping f : X → N is said to be consecutive if f(X) is consecutive. A vertex-graceful labeling f is said to be strong if the function ƒ₁ : E → N

APA, Harvard, Vancouver, ISO, and other styles

42

Abdullah Zahraa O, Arif Nabeel E, and F. A. Fawzi. "Dividing Graceful Labeling of Certain Tree Graphs." Tikrit Journal of Pure Science 25, no. 4 (2020): 123–26. http://dx.doi.org/10.25130/tjps.v25i4.281.

Full text

Abstract:

A tree is a connected acyclic graph on n vertices and m edges. graceful labeling of a tree defined as a simple undirected graph G(V,E) with order n and size m, if there exist an injective mapping that induces a bijective mapping defined by for each and . In this paper we introduce a new type of graceful labeling denoted dividing graceful then discuss this type of certain tree graphs .

APA, Harvard, Vancouver, ISO, and other styles

43

Velmurugan, C., and Ramachandran V. "M modulo N Graceful Labeling on Arbitrary Super Subdivision of Ladder Graph." Mapana Journal of Sciences 22, Special Issue (2023): 69–88. https://doi.org/10.12723/mjs.sp1.7.

Full text

Abstract:

In this paper, we show that arbitrary super subdivisions of ladder graphs and super subdivisions of ladder graphs are M modulo N graceful Labeling. Furthermore, on the given graph, a C++ programme is used to trace the M modulo N graceful labeling.

APA, Harvard, Vancouver, ISO, and other styles

44

V.T. Brindha Mary, C. David Raj, and C. Jayasekaran. "Radio even mean graceful labeling on some special graphs." Malaya Journal of Matematik 8, no. 04 (2020): 2323–28. http://dx.doi.org/10.26637/mjm0804/0175.

Full text

Abstract:

Radio Even Mean Graceful Labeling of a connected graph \(G\) is a bijection \(\phi\) from the vertex set \(V(G)\) to \(\{2,4,6, \ldots 2|V|\}\) satisfying the condition \(d(s, t)+\left\lceil\frac{\phi(s)+\phi(t)}{2}\right\rceil \geq 1+\operatorname{diam}(G)\) for every \(\mathrm{s}, \mathrm{t} \in \mathrm{V}(\mathrm{G})\). A graph which admits radio even mean graceful labeling is called radio even mean graceful graph. In this paper we investigate the radio even mean graceful labeling on degree splitting of some special graphs.

APA, Harvard, Vancouver, ISO, and other styles

45

Sumathi, P., and G. Geetha Ramani. "Arithmetic Sequential Graceful Labeling For Arrow Graphs." IOSR Journal of Mathematics 20, no. 5 (2024): 11–17. http://dx.doi.org/10.9790/0661-2005011117.

Full text

Abstract:

Let G be a simple, finite, connected, undirected, non-trivial graph with 𝑝 vertices and 𝑞 edges. 𝑉(𝐺) be the vertex set and 𝐸(𝐺) be the edge set of 𝐺. Let 𝑓: 𝑉(𝐺) → {𝑎, 𝑎 + 𝑑, 𝑎 + 2𝑑, 𝑎 + 3𝑑, … , 𝑎 + 2𝑞𝑑} where a ≥ 0 and 𝑑 ≥ 1 is an injective function. If for each edge 𝑢𝑣 ∈ 𝐸(𝐺) , 𝑓 ∗ : 𝐸(𝐺) → {𝑑, 2𝑑, 3𝑑, 4𝑑, … , 𝑞𝑑} defined by 𝑓 ∗ (𝑢𝑣) = |𝑓(𝑢)− 𝑓(𝑣)| is a bijective function then the function 𝑓 is called arithmetic sequential graceful labeling. The graph with arithmetic sequential graceful labeling is called arithmetic sequential graceful graph. In this paper, we prove that one side arrow grap

APA, Harvard, Vancouver, ISO, and other styles

46

Kumar, A., V. Kumar, K. Kumar, P. Gupta, and Y. Khandelwal. "G-GRACEFUL LABELING OF GRAPHS." Advances in Mathematics: Scientific Journal 9, no. 4 (2020): 1973–81. http://dx.doi.org/10.37418/amsj.9.4.56.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Saha, Laxman. "Radio Graceful Labelling of Graphs." Theory and Applications of Graphs 7, no. 1 (2020): 1–8. http://dx.doi.org/10.20429/tag.2020.070107.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

GAO, ZHEN-BIN, XIAO-DONG ZHANG, and LI-JUAN XU. "ODD GRACEFUL LABELINGS OF GRAPHS." Discrete Mathematics, Algorithms and Applications 01, no. 03 (2009): 377–88. http://dx.doi.org/10.1142/s1793830909000300.

Full text

Abstract:

A graph G = (V(G), E(G)) with q edges is said to be odd graceful if there exists an injection f from V(G) to {0, 1, 2, …, 2q - 1} such that the edge labeling set is {1, 3, 5, …, 2q - 1} with each edge xy assigned the label |f(x) - f(y)|. In this paper, we prove that Pn × Pm (m = 2, 3, 4), generalized crown graphs Cn ⊙ K1,t and gear graphs are odd graceful.

APA, Harvard, Vancouver, ISO, and other styles

49

Acharya, Mukti, and T. Singh. "Construction of Graceful Signed Graphs." Defence Science Journal 56, no. 5 (2006): 801–8. http://dx.doi.org/10.14429/dsj.56.1948.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Fujie-Okamoto, Futaba, Ryan Jones, Kyle Kolasinski, and Ping Zhang. "On Modular Edge-Graceful Graphs." Graphs and Combinatorics 29, no. 4 (2012): 901–12. http://dx.doi.org/10.1007/s00373-012-1147-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!