Log in

Relevant bibliographies by topics / Graceful graphs

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Graceful graphs"

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

More sources

Dissertations / Theses on the topic "Graceful graphs"

1

Chan, Tsz-lung. "Graceful labelings of infinite graphs." Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/hkuto/record/B39332184.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chan, Tsz-lung, and 陳子龍. "Graceful labelings of infinite graphs." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B39332184.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Aftene, Florin. "Vertex-Relaxed Graceful Labelings of Graphs and Congruences." TopSCHOLAR®, 2018. https://digitalcommons.wku.edu/theses/2664.

Full text

Abstract:

A labeling of a graph is an assignment of a natural number to each vertex of a graph. Graceful labelings are very important types of labelings. The study of graceful labelings is very difficult and little has been shown about such labelings. Vertex-relaxed graceful labelings of graphs are a class of labelings that include graceful labelings, and their study gives an approach to the study of graceful labelings. In this thesis we generalize the congruence approach of Rosa to obtain new criteria for vertex-relaxed graceful labelings of graphs. To do this, we generalize Faulhaber’s Formula, which

APA, Harvard, Vancouver, ISO, and other styles

4

Cheng, Hee Lin. "Supermagic labeling, edge-graceful labeling and edge-magic index of graphs." HKBU Institutional Repository, 2000. http://repository.hkbu.edu.hk/etd_ra/280.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Niedzialomski, Amanda Jean. "Consecutive radio labelings and the Cartesian product of graphs." Diss., University of Iowa, 2013. https://ir.uiowa.edu/etd/4886.

Full text

Abstract:

For k∈{Z}+ and G a simple connected graph, a k-radio labeling f:VG→Z+ of G requires all pairs of distinct vertices u and v to satisfy |f(u)-f(v)|≥ k+1-d(u,v). When k=1, this requirement gives rise to the familiar labeling known as vertex coloring for which each vertex of a graph is labeled so that adjacent vertices have different "colors". We consider k-radio labelings of G when k=diam(G). In this setting, no two vertices can have the same label, so graphs that have radio labelings of consecutive integers are one extreme o

APA, Harvard, Vancouver, ISO, and other styles

6

Bournat, Marjorie. "Graceful Degradation and Speculation for Robots in Highly Dynamic Environments." Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS035.

Full text

Abstract:

Les systèmes distribués sont des systèmes composés de plusieurs processus communiquants et coopérants ensemble pour résoudre des tâches communes. C’est un modèle générique pour de nombreux systèmes réels comme les réseaux sans fil ou mobiles, les systèmes multiprocesseurs à mémoire partagée, etc. D’un point de vue algorithmique, il est reconnu que de fortes hypothèses (comme l’asynchronisme ou la mobilité) sur de tels systèmes mènent souvent à des résultats d’impossibilité ou à de fortes bornes inférieures sur les complexités. Dans cette thèse, nous étudions des algorithmes qui s’auto-adaptent

APA, Harvard, Vancouver, ISO, and other styles

7

Meadows, Adam M. "Decompositions of Mixed Graphs with Partial Orientations of the P₄." Digital Commons @ East Tennessee State University, 2009. https://dc.etsu.edu/etd/1870.

Full text

Abstract:

A decomposition D of a graph H by a graph G is a partition of the edge set of H such that the subgraph induced by the edges in each part of the partition is isomorphic to G. A mixed graph on V vertices is an ordered pair (V,C), where V is a set of vertices, |V| = v, and C is a set of ordered and unordered pairs, denoted (x, y) and [x, y] respectively, of elements of V [8]. An ordered pair (x, y) ∈ C is called an arc of (V,C) and an unordered pair [x, y] ∈ C is called an edge of graph (V,C). A path on n vertices is denoted as Pn. A partial orientation on G is obtained by replacing each edge [x,

APA, Harvard, Vancouver, ISO, and other styles

8

Jum, Ernest. "The Last of the Mixed Triple Systems." Digital Commons @ East Tennessee State University, 2009. https://dc.etsu.edu/etd/1876.

Full text

Abstract:

In this thesis, we consider the decomposition of the complete mixed graph on v vertices denoted Mv, into every possible mixed graph on three vertices which has (like Mv) twice as many arcs as edges. Direct constructions are given in most cases. Decompositions of theλ-fold complete mixed graph λMv, are also studied.

APA, Harvard, Vancouver, ISO, and other styles

9

Hsu, Yen-Wu, and 許炎午. "Graceful Labelings of Some Special Graphs." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/15033129902556277565.

Full text

Abstract:

碩士<br>淡江大學<br>中等學校教師在職進修數學教學碩士學位班<br>103<br>Let G be a simple graph with q edges. If there exists a function f from V(G) to {0, 1, 2, ..., q} and f is one-to-one. If from f we can get a function g, g : E(G)→{1, 2, ..., q} defined by g(e) =│ f (u) − f (v)│for every edge e = {u, v}∈E(G), and g is a bijective function, then we call f is a graceful labeling of G and the graph G is a graceful graph. Let Cn⊙Pm be the graph obtained by attaching a path Pm to each vertex of an n-cycle Cn. Let Cn⊙[(n－1)Pm∪Pu] be the graph obtained by attaching a path Pu to a vertex of an n-cycle Cn and attaching a pat

APA, Harvard, Vancouver, ISO, and other styles

10

WU, SHUN-LIANG, and 吳順良. "On the new constructions of graceful graphs." Thesis, 1989. http://ndltd.ncl.edu.tw/handle/09357296953549363294.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Graceful graphs"

1

on edge graceful labelling of graph. 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cantine, Elizabeth Michele. Graceful Gratitude: A Book of Holiday Graces. 4ARTS EDUCATION PRESS, 2018.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Arteage, William L. De. Aging Gracefully with the Graces of Healing Prayer. Emeth Press, 2019.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Tales From A Not-So-Graceful Ice Princess. Aladdin, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Graceful graphs"

1

Murugan, M. "Bi-Graceful Graphs." In Number Theory and Discrete Mathematics. Birkhäuser Basel, 2002. http://dx.doi.org/10.1007/978-3-0348-8223-1_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Murugan, M. "Bi-Graceful Graphs." In Number Theory and Discrete Mathematics. Hindustan Book Agency, 2002. http://dx.doi.org/10.1007/978-93-86279-10-1_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bača, Martin, Mirka Miller, Joe Ryan, and Andrea Semaničová-Feňovčíková. "Graceful and Antimagic Labelings." In Magic and Antimagic Graphs. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-24582-5_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Petrie, Karen E., and Barbara M. Smith. "Symmetry Breaking in Graceful Graphs." In Principles and Practice of Constraint Programming – CP 2003. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45193-8_81.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hiren, P. Chudasama, and K. Jadeja Divya. "Universal Absolute Mean Graceful Graphs." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Smith, Barbara M. "Constraint Programming Models for Graceful Graphs." In Principles and Practice of Constraint Programming - CP 2006. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11889205_39.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Divya, K. Jadeja, and V. J. Kaneria. "Universal α-graceful Gear related Graphs." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Hemalatha, P. K., R. Shanmugapriya, D. Kanagajothi, and M. Vasuki. "A Study on Modified Fuzzy Graceful Labeling Graphs." In Lecture Notes in Networks and Systems. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-91005-0_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zhi-Zeng, C. "A Generalization of the Bodendiek Conjecture About Graceful Graphs." In Topics in Combinatorics and Graph Theory. Physica-Verlag HD, 1990. http://dx.doi.org/10.1007/978-3-642-46908-4_83.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kaneria, V. J., and J. C. Kanani. "Graceful Labeling for Eight Sprocket Graph." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graceful graphs"

1

Indunil, W. K. M., та A. A. I. Perera. "𝒌 – Graceful Labeling of Triangular Type Grid Graphs 𝑫𝒏(𝑷𝒎) and 𝑳 – Vertex Union of 𝑫𝒏(𝑷𝒎)". У SLIIT 2nd International Conference on Engineering and Technology. SLIIT, 2023. http://dx.doi.org/10.54389/ilio4846.

Full text

Abstract:

Graph labeling is one of the most popular research topics in the field of graph theory. Prime labeling, antimagic labeling, radio labeling, graceful labeling, lucky labeling, and incidence labeling are some of the labeling techniques. Among the above-mentioned techniques, graceful labeling is one of the most engaging graph labeling techniques with a vast amount of real-world applications. Over the past few decades, plenty of studies have been conducted on this area in various dimensions. Grid graphs are very much useful in applications of circuit theory, communication networks, and transportat

APA, Harvard, Vancouver, ISO, and other styles

2

Branson, Luke, and Andrew M. Sutton. "Evolving labelings of graceful graphs." In GECCO '22: Genetic and Evolutionary Computation Conference. ACM, 2022. http://dx.doi.org/10.1145/3512290.3528855.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Pakpahan, R. N., I. Mursidah, I. D. Novitasari, and K. A. Sugeng. "Graceful labeling for some supercaterpillar graphs." In INTERNATIONAL SYMPOSIUM ON CURRENT PROGRESS IN MATHEMATICS AND SCIENCES 2016 (ISCPMS 2016): Proceedings of the 2nd International Symposium on Current Progress in Mathematics and Sciences 2016. Author(s), 2017. http://dx.doi.org/10.1063/1.4991225.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Susanti, Yeni, Iwan Ernanto, and Budi Surodjo. "On some new edge odd graceful graphs." In PROCEEDINGS OF THE 8TH SEAMS-UGM INTERNATIONAL CONFERENCE ON MATHEMATICS AND ITS APPLICATIONS 2019: Deepening Mathematical Concepts for Wider Application through Multidisciplinary Research and Industries Collaborations. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5139142.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Gudgeri, Manjula C., Varsha, and Pallavi Sangolli. "Extended Roman Domination of some graceful graphs." In THIRD VIRTUAL INTERNATIONAL CONFERENCE ON MATERIALS, MANUFACTURING AND NANOTECHNOLOGY. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0096414.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Soleha, Maulidatus, Purwanto, and Desi Rahmadani. "Some snake graphs are edge odd graceful." In THE 3RD INTERNATIONAL CONFERENCE ON SCIENCE, MATHEMATICS, ENVIRONMENT, AND EDUCATION: Flexibility in Research and Innovation on Science, Mathematics, Environment, and education for sustainable development. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0106218.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Velankanni, A., A. Bernick Raj, and M. Sujasree. "Bistar and comb related odd graceful graphs." In THE 12TH INTERNATIONAL CONFERENCE ON MECHANICAL ENGINEERING (TSME-ICoME 2022). AIP Publishing, 2024. http://dx.doi.org/10.1063/5.0208251.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Lakshmi, A. Rama, and M. P. Syed Ali Nisaya. "Centered polygonal graceful labeling of some graphs." In THE 12TH INTERNATIONAL CONFERENCE ON MECHANICAL ENGINEERING (TSME-ICoME 2022). AIP Publishing, 2024. http://dx.doi.org/10.1063/5.0208205.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

De Silva, K. H. C., and A. A. I. Perera. "Odd Prime Labeling of Snake Graphs." In SLIIT 2nd International Conference on Engineering and Technology. SLIIT, 2023. http://dx.doi.org/10.54389/lufm4069.

Full text

Abstract:

Graph theory is one of the branches of mathematics which is concerned with the networks of points connected by lines. One of the most important research areas in graph theory is graph labeling, which dates back to the 1960s. Graph labeling is assigning integers to the vertices, edges, or both depending on conditions. Labeled graphs are helpful in mathematical models for a wide range of applications such as in coding theory, circuit theory, computer networks, and in cryptography as well. There are various types of graph labeling techniques in graph theory such as radio labeling, graceful labeli

APA, Harvard, Vancouver, ISO, and other styles

10

Liu, Xinsheng, Yuanyuan Liu, Bing Yao, Yumei Ma, and Hua Lian. "On odd-graceful labelings of irregular dragon graphs." In 2014 International Conference on Progress in Informatics and Computing (PIC). IEEE, 2014. http://dx.doi.org/10.1109/pic.2014.6972368.

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!