Relevant bibliographies by topics / −i} Cordial labeling

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers
  5. Reports

Academic literature on the topic '−i} Cordial labeling'

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 '−i} Cordial labeling.'

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 "−i} Cordial labeling"

1

S. K. Vaidya and N B Vyas. "Product cordial labeling for alternate snake graphs." Malaya Journal of Matematik 2, no. 03 (2014): 188–96. http://dx.doi.org/10.26637/mjm203/002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gulab Minj, Dibya, G. V. V. Jagannadha Rao, and Chiranjilal Kujur. "TRUTH TABLE - SMARANDACHLEY PRODUCT CORDIAL LABELING OF BLOOM TORUS GRAPH BTM,N." International Journal of Advanced Research 11, no. 02 (2023): 713–26. http://dx.doi.org/10.21474/ijar01/16303.

Full text
Abstract:
In this paper the researcher prepares truth table for the labeling of Bloom Torus graph by admitting the condition of Smarandachely product cordial labelling. Smarandachely product cordial labeling on is such a labeling with induced labeling
APA, Harvard, Vancouver, ISO, and other styles
3

Neerajah, A., and P. Subramanian. "A STUDY ON ZERO-M CORDIAL LABELING." Advances in Mathematics: Scientific Journal 9, no. 11 (2020): 9207–18. http://dx.doi.org/10.37418/amsj.9.11.26.

Full text
Abstract:
A labeling $f: E(G) \rightarrow \{1, -1\}$ of a graph G is called zero-M-cordial, if for each vertex v, the arithmetic sum of the labels occurrence with it is zero and $|e_{f}(-1) - e_{f}(1)| \leq 1$. A graph G is said to be Zero-M-cordial if a Zero-M-cordial label is given. Here the exploration of zero - M cordial labelings for deeds of paths, cycles, wheel and combining two wheel graphs, two Gear graphs, two Helm graphs. Here, also perceived that a zero-M-cordial labeling of a graph need not be a H-cordial labeling.
APA, Harvard, Vancouver, ISO, and other styles
4

A R, Nagalakshmi. "The Cordial Energy of Some Graphs." Proyecciones (Antofagasta) 43, no. 6 (2024): 1455–71. https://doi.org/10.22199/issn.0717-6279-6403.

Full text
Abstract:
This paper provides a comprehensive investigation into cordial spectra and energy. The study delves into the fundamental principles of cordial labeling, where graph vertices are assigned labels to maintain balanced adjacency. The analysis includes mathematical properties and the interplay between cordial labeling and graph energy. Spectral analysis involving eigenvalues of matrices associated with cordially labeled graphs is explored, offering insights into graph structural characteristics and relationships.
APA, Harvard, Vancouver, ISO, and other styles
5

Samir K. Vaidya and Chirag M. Barasara. "Total edge product cordial labeling of graphs." Malaya Journal of Matematik 1, no. 03 (2013): 55–63. http://dx.doi.org/10.26637/mjm103/009.

Full text
Abstract:
The total product cordial labeling is a variant of cordial labeling. We introduce an edge analogue product cordial labeling as a variant of total product cordial labeling and name it as total edge product cordial labeling. Unlike to total product cordial labeling the roles of vertices and edges are interchanged in total edge product cordial labeling. We investigate several results on this newly defined concept.
APA, Harvard, Vancouver, ISO, and other styles
6

R, Charishma, and Nageswari P. "Cordial Labeling of Subdivision of Central Edge of Bistar Graph and Spider Graph." Indian Journal of Science and Technology 16, no. 35 (2023): 2889–93. https://doi.org/10.17485/IJST/v16i35.679.

Full text
Abstract:
Abstract <strong>Objectives:</strong>&nbsp;To analyse cordial labelling of subdivision of central edge of bistar graph and Spider graph.&nbsp;<strong>Methods:</strong>&nbsp;Cordial labeling is defined as a function g : V (q ) ! f0;1g in which each edge ab is assigned the label jg(a)􀀀g(b)j with the conditions vg(0)􀀀vg(1) 1 and eg(0)􀀀eg(1) 1 1 where v g ( 0 ) and v g ( 1 ) signify the number of vertices with 0&rsquo;s and 1&rsquo;s, similarly eg (0) and eg (1) signify the number of edges with 0&rsquo;s and 1&rsquo;s.&nbsp;<strong>Findings:</strong>&nbsp;In this paper, it is proved that subdivisi
APA, Harvard, Vancouver, ISO, and other styles
7

T.Nicholas and P.Maya. "Some results on integer cordial graph." Journal of Progressive Research in Mathematics 8, no. 1 (2016): 1183–94. https://doi.org/10.5281/zenodo.4028748.

Full text
Abstract:
An integer cordial labeling of a graph G(V, E) is an injective map f from V to &minus; 𝑝 2 . . 𝑝 2 &lowast; or &minus; 𝑝 2 . . 𝑝 2 as p is even or odd, which induces an edge labeling f * : E &rarr; {0, 1} defined by f * (uv) = 1 if f(u) + f(v) &ge; 0 and 0 otherwise such that the number of edges labeled with1 and the number of edges labeled with 0 differ atmost by 1. If a graph has integer cordial labeling, then it is called integer cordial graph. In this paper, we introduce the concept of integer cordial labeling and prove that some standard graphs are integer cordial.
APA, Harvard, Vancouver, ISO, and other styles
8

A., A., and A. Rajkumar. "Neutrosophic Cordial Labeling on Helm and Closed Helm Graph." International Journal of Neutrosophic Science 25, no. 4 (2025): 453–52. https://doi.org/10.54216/ijns.250439.

Full text
Abstract:
The Neutrosophic Cordial Labeling Graph integrates both neutrosophic labeling and Cordial Labeling. Building on our previous work, we have extended our study to include Neutrosophic Cordial Labeling for Helm and Closed Helm Graphs. This extension allows us to explore the application of Neutrosophic Cordial Labeling in more complex graph structures, providing insights into their properties and relationships. One of the key aspects of our research is investigating the relationship between Cordial and Neutrosophic Cordial Labeling. By comparing and contrasting these labeling techniques [4], we ai
APA, Harvard, Vancouver, ISO, and other styles
9

A. Sathakathulla, A., and M. G Fajlul Kareem. "Edge cordial and total edge cordial labeling for eight sprocket graph." International Journal of Applied Mathematical Research 10, no. 2 (2021): 18. http://dx.doi.org/10.14419/ijamr.v10i2.31621.

Full text
Abstract:
This papers deals with the Edge cordial labeling of newly introduced eight sprocket graph. This graph is already proven as cordial and gracious in graph labelling. In our study we have further proved that Eight Sprocket graph related families of connected edge-cordial graphs. Also the path union of Eight Sprocket graph, cycle of Eight Sprocket graph and star of Eight Sprocket graph are Edge-cordial.
APA, Harvard, Vancouver, ISO, and other styles
10

Lourdusamy, A., E. Veronisha, and F. Joy Beaula. "Group S4 Difference Cordial Labeling." Indian Journal Of Science And Technology 15, no. 32 (2022): 1561–68. http://dx.doi.org/10.17485/ijst/v15i32.614.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "−i} Cordial labeling"

1

Cho, Wen-Hsun, and 卓文勛. "Cordial labelings and 3-cordial labelings of union and join of graphs." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/42911847041201420411.

Full text
Abstract:
碩士<br>國立東華大學<br>應用數學系<br>94<br>Let G be a graph with vertex set V (G) and edge set E (G), and let A be an abelian group. A vertex labeling f : V(G) →A induces an edge labeling f * : E(G) → A, defined by f *(uv) = f (u) + f (v) for all uv belongs to E (G). For i belongs to A, let v_f^i(G)=|{v belongs to V(G):f(v)=i}|, e_f^i(G)=|{e belongs to E(G):f * (e)=i}|。A labeling of a graph G is said to be A-friendly if |v_f^i(G)−v_f^j(G)|≦1 for all (i,j) belongs to A×A. An A-friendly labeling f of G is said to be an A-cordial labeling of G if |e_f^i(G)−e_f^j(G)|≦1 for all (i,j)belongs to A×A. A graph G i
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "−i} Cordial labeling"

1

Murali, B. J., K. Thirusangu, and R. Madura Meenakshi. "Zumkeller Cordial Labeling of Graphs." In Advances in Intelligent Systems and Computing. Springer Singapore, 2015. http://dx.doi.org/10.1007/978-981-10-0251-9_49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lourdusamy, A., and F. Patrick. "New Construction on SD-Prime Cordial Labeling." In Theoretical Computer Science and Discrete Mathematics. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64419-6_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Prajapati, U. M., and K. K. Raval. "A Few Results on Fibonacci Cordial Labeling." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Parameswari, R., and C. Jayalakshmi. "On Cordial Totally Magic Labeling of Flower Graphs." In ICT Analysis and Applications. Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-5224-1_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Barasara, Chirag M. "Edge Product Cordial and Total Edge Product Cordial Labeling of Some Wheel related Graphs." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bosmia, M. I., and Kailas K. Kanani. "Product Cordial Labeling for the Line Graph of Bistar." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Balamurugan, B. J., K. Thirusangu, B. J. Murali, and J. Venkateswara Rao. "Computation of Narayana Prime Cordial Labeling of Book Graphs." In Trends in Mathematics. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-01123-9_54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ramani Bai, D., and J. Senbagamalar. "Cubic Roots Cordial Labeling of Sunlet and Friendship Graphs." In Lecture Notes in Networks and Systems. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-90998-6_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sadawarte, Sarang, and Sweta Srivastav. "On Signed Product Cordial Labeling of Pan-Related Graphs." In Springer Proceedings in Mathematics & Statistics. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-3460-6_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Prajapati, U. M., and A. V. Vantiya. "SD-Prime Cordial Labeling of Double k-Polygonal Snake Graph." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "−i} Cordial labeling"

1

Suganya, S., and V. J. Sudhakar. "Cordial labeling in various graphs." In CONTEMPORARY INNOVATIONS IN ENGINEERING AND MANAGEMENT. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0150578.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Steffi, S. Nila, та J. Subhashini. "Sum binary ℒ-Cordial labeling". У INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS, COMPUTING AND COMMUNICATION TECHNOLOGIES: (ICAMCCT 2021). AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0070742.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Devi, Brindha, S. Kavitha, and D. Nidha. "PD mean cordial labeling of graphs." In PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS RESEARCH (ICAMR - 2019). AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0016867.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Subashini, G., K. Manimekalai, and K. Ramanathan. "Prime cordial labeling of Hn⊙K2 graph." In THE 11TH NATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5112313.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kalaimathi, M., and B. J. Balamurugan. "Biconditional cordial labeling of cycle related graphs." In 4TH INTERNATIONAL CONFERENCE ON THE SCIENCE AND ENGINEERING OF MATERIALS: ICoSEM2019. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0028659.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rani, A. Asha, K. Thirusangu, B. J. Balamurugan, and A. Manonmani. "Narayana prime cordial labeling of grid graph." In 4TH INTERNATIONAL CONFERENCE ON THE SCIENCE AND ENGINEERING OF MATERIALS: ICoSEM2019. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0028719.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Suganya, S., and V. J. Sudhakar. "Sum divisor cordial labeling of various graphs." In CONTEMPORARY INNOVATIONS IN ENGINEERING AND MANAGEMENT. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0150570.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Parejiya, Jaydeep, Premkumar Lalchandani, Daxa Jani, and Sneha Mundadiya. "Some remarks on harmonic mean cordial labeling." In INTERNATIONAL CONFERENCE ON SCIENCE, ENGINEERING, AND TECHNOLOGY 2022: Conference Proceedings. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0183341.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Arockiasamy, M. Antony, and P. Thirupathi. "Divided cube difference cordial labeling of graphs." In INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS, COMPUTING AND COMMUNICATION TECHNOLOGIES: (ICAMCCT 2021). AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0071073.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Begum, P. Hameetha, M. Amirthakodi, and S. Akila Devi. "Intersection cordial labeling of some regular graphs." In MATHEMATICS AND ITS APPLICATIONS IN TECHNOLOGY. AIP Publishing, 2024. http://dx.doi.org/10.1063/5.0224938.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "−i} Cordial labeling"

1

Ullah, Rizwan, Gul Rahman, Tania Bibi, Muhammad Numan, and Andrea Semaničová-Fenovčíková. On 3‑total Edge Product Cordial Labelling of Octagonal Plane Map. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, 2021. http://dx.doi.org/10.7546/crabs.2021.11.02.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic '−i} Cordial labeling' for particular source types:
Journal articles
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!

To the bibliography