Log in

Relevant bibliographies by topics / Group A Cordial labeling / Journal articles

To see the other types of publications on this topic, follow the link: Group A Cordial labeling.

Journal articles on the topic 'Group A 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 top 50 journal articles for your research on the topic 'Group A 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.

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

1

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

2

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

Full text

Abstract:

Abstract <strong>Objective:</strong> To find the Group S4 difference cordial labeling of some standard graphs. <strong>Method:</strong> Path, Cycle and some standard graphs are converted into Group S4 difference cordial graphs by labeling the vertices with the elements of S4 and the edges as the difference of the order of the elements labeled to the vertices of the graph. <strong>Findings:</strong> Group S4 difference cordial labeling for path, cycle and some standard graphs. <strong>Novelty:</strong> Graph labeling can use for issues in Mobile Adhoc Networks

APA, Harvard, Vancouver, ISO, and other styles

3

B., Chandra*1 &. R. Kala2. "GROUP S3 CORDIAL PRIME LABELING OF WHEEL RELATED GRAPH." GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES 5, no. 12 (2018): 150–59. https://doi.org/10.5281/zenodo.2390060.

Full text

Abstract:

Let <em>G </em>= (<em>V </em>(<em>G</em>)<em>, E</em> (<em>G</em>)) be a graph. Consider the group <em>S</em><sub>3</sub>. For , let  denote the order of <em>u </em>in <em>S</em><sub>3</sub>. Let be a function defined in such a way that . Let  denote the number of vertices of <em>G </em>having label <em>j </em>under . Now is called a group cordial prime labeling if  for every . A graph which admits a group cordial prime labeling is called a group cordial prime graph. In this paper, we prove that the Helm graph, Flower graph and  are group <em>S</em><sub>3 </sub>cordial prim

APA, Harvard, Vancouver, ISO, and other styles

4

I.Beaulah Bell, R. Kala. "Group Difference Cordial Labeling in Graphs." Tuijin Jishu/Journal of Propulsion Technology 44, no. 4 (2023): 4642–48. http://dx.doi.org/10.52783/tjjpt.v44.i4.1770.

Full text

Abstract:

. Let group .For denotes  .  which is the group of fourth roots of unity, that is cyclic with generators i and -i. We proved that path graph, bistar graph, and Crown graph are We Ladder graph, and star graph is a difference cordial graph.

APA, Harvard, Vancouver, ISO, and other styles

5

R.N. Rajalekshmi and R. Kala. "Group mean cordial labeling of some splitting graphs." Malaya Journal of Matematik 8, no. 04 (2020): 2352–55. http://dx.doi.org/10.26637/mjm0804/0181.

Full text

Abstract:

Let \(G\) be a \((p, q)\) graph and let \(A\) be a group. Let \(f: V(G) \longrightarrow A\) be a map. For each edge \(u v\) assign the label \(\left\lfloor\frac{o(f(u))+o(f(v))}{2} \mid\right.\). Here \(o(f(u))\) denotes the order of \(f(u)\) as an element of the group \(A\). Let \(\mathbb{I}\) be the set of all integers that are labels of the edges of \(G\). \(f\) is called a group mean cordial labeling if the following conditions hold:(1) For \(x, y \in A,\left|v_f(x)-v_f(y)\right| \leq 1\), where \(v_f(x)\) is the number of vertices labeled with \(x\).(2) For \(i, j \in \mathbb{I},\left|e_f

APA, Harvard, Vancouver, ISO, and other styles

6

A. Sudha Rani. "On Vertex, Edge Matrix Cordial Labeling." Advances in Nonlinear Variational Inequalities 28, no. 7s (2025): 411–18. https://doi.org/10.52783/anvi.v28.4538.

Full text

Abstract:

Let G be a simple undirected graph whose vertices are from non cyclic abelian group and there is an edge between any two vertices iff vertices form a non singular matrix. Here we assign the Matrix Cordial Labeling to the vertices. In this paper we introduce the concept of Matrix Cordial labeling for some splitting graphs We shall discuss Matrix Cordial Labeling for path, cycle . Conclusions: In this paper we investigated three new matrix cordial graphs. The findings in this paper are original. For a better understanding of the labeling pattern specified in each theorem, illustrations are given

APA, Harvard, Vancouver, ISO, and other styles

7

R N, Rajalekshmi, and Kala R. "GROUP MEAN CORDIAL LABELING OF SOME QUADRILATERAL SNAKE GRAPHS." Journal of the Indonesian Mathematical Society 30, no. 3 (2024): 374–84. http://dx.doi.org/10.22342/jims.30.3.1210.374-384.

Full text

Abstract:

Let G be a (p, q) graph and let A be a group. Let f : V (G) −→ A be a map. For each edge uv assign the label [o(f (u))+o(f (v)) / 2]. Here o(f (u)) denotes the order of f (u) as an element of the group A. Let I be the set of all integerslabeled by the edges of G. f is called a group mean cordial labeling if the following conditions hold: (1) For x, y ∈ A, |vf (x) − vf (y)| ≤ 1, where vf (x) is the number of vertices labeled with x. (2) For i, j ∈ I, |ef (i) − ef (j)| ≤ 1, where ef (i) denote the number of edges labeled with i. A graph with a group mean cordial labeling is called a group mean c

APA, Harvard, Vancouver, ISO, and other styles

8

M.K., Karthik Chidambaram, S.Athisayanathan, and R.Ponraj. "GROUP {1, −1, i, −i} CORDIAL LABELING OF SOME SPLITTING GRAPHS." GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES 4, no. 11 (2017): 83–88. https://doi.org/10.5281/zenodo.1059417.

Full text

Abstract:

Let G be a (p,q)graph and A be a group. Let f : V (G) → A be a function. The order of a ∈ A is the least positive integer n such that a<sup>N</sup> = e. We denote the order of a by o(a). For each edge uv assign the label 1 if (o(f (u)), o(f (v))) = 1or 0 otherwise. f is called a group A Cordial labeling if |v<sub>F</sub> (a) − v<sub>F</sub> (b)| ≤ 1 and |e<sub>F</sub> (0) − e<sub>F</sub> (1)| ≤ 1, where v<sub>F</sub> (x) and e<sub>F</sub> (n) respectively denote the number of vertices labeled with an element x and number of edges labeled with n(n = 0, 1). A graph which admits a group A Cordial

APA, Harvard, Vancouver, ISO, and other styles

9

K. Karthik Chidambaram, M., S. Athisayanathan, and R. Ponraj. "Group {1, -1, i, -i} Cordial Labeling of Some Shadow Graphs." International Journal of Science and Research (IJSR) 12, no. 12 (2023): 908–11. http://dx.doi.org/10.21275/sr231205144516.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Chandra, B., and R. Kala. "Group $S_{3}$ cordial prime labeling of graphs." Malaya Journal of Matematik S, no. 1 (2019): 403–7. http://dx.doi.org/10.26637/mjm0s01/0072.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Boxwala, Samina, Aditi S. Phadke, and Pramod N. Shinde. "On Group A-Cordial Labeling of Uniform t-Ply." International Journal of Mathematics Trends and Technology 68, no. 7 (2022): 21–25. http://dx.doi.org/10.14445/22315373/ijmtt-v68i7p504.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

ELrokh, Ashraf, Mohammed M. Ali Al-Shamiri, Mohammed M. A. Almazah, and Atef Abd El-hay. "A Novel Problem for Solving Permuted Cordial Labeling of Graphs." Symmetry 15, no. 4 (2023): 825. http://dx.doi.org/10.3390/sym15040825.

Full text

Abstract:

In this paper, we used the permutation group together with the concept of cordiality in graph theory to introduce a new method of labeling. This construed permuted cordial labeling can be applied to all paths, cycles, fans and wheel graphs. Moreover, some other properties are investigated and show that the union of any two paths and the union of any two cycles are permuted cordial graphs. In addition, we investigated the permuted cordiality for the union of any path with cycle.

APA, Harvard, Vancouver, ISO, and other styles

13

ELrokh, Ashraf, Rashad Ismail, Atef Abd El-hay, and Yasser Elmshtaye. "On Cubic Roots Cordial Labeling for Some Graphs." Symmetry 15, no. 5 (2023): 990. http://dx.doi.org/10.3390/sym15050990.

Full text

Abstract:

In this paper we used the cubic roots of unit group together with the concept of cordiality in graph theory to introduce a new method of labeling, this construed cubic cordial labeling can be applied to all paths, cycles, fans and wheel graphs. Moreover, some other properties are investigated and show that the union of any two cycles and the union any two paths are cubic cordial graphs. Also, we study the cubic cordiality for the union of any cycle with a path.

APA, Harvard, Vancouver, ISO, and other styles

14

Karthik Chidambaram, M. K., S. Athisayanathan, and R. Ponraj. "Group {1, −1, i, −i} Cordial Labeling of Product Related Graphs." International Journal of Advanced Scientific Research & Development (IJASRD) 4, no. 6 (2017): 27. http://dx.doi.org/10.26836/ijasrd/2017/v4/i6/4604.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Chidambaram, M. K. Karthik, S. Athisayanathan, and R. Ponraj. "Group {1,−1, i, −i} Cordial Labeling of Certain Splitting Graphs." Annals of Pure and Applied Mathematics 15, no. 2 (2017): 215–23. http://dx.doi.org/10.22457/apam.v15n2a8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Ramya, G., and D. Kalamani. "Some cordial labeling for commuting graph of a subset of the dihedral group." Malaya Journal of Matematik 9, no. 1 (2021): 461–64. http://dx.doi.org/10.26637/mjm0901/0077.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

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

18

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

19

Seoud, M. A., A. T. M. Matar, and R. A. Al-Zuraiqi. "Prime Cordial Labeling." Circulation in Computer Science 2, no. 4 (2017): 1–10. http://dx.doi.org/10.22632/ccs-2017-251-98.

Full text

Abstract:

We show that some special families of graphs have prime cordial labeling. We prove that If G is not a prime cordial graph of order m then G∪K_(1,n)is a prime cordial graph if E(G)= n-1,n or n+1 , and we prove that S^' (K_(2,n)), Jelly fish graph , Jewel graph, the graph obtained by duplicating a vertex v_k in the rim of the helm H_nand the graph obtained by fusing the vertex u_1 with u_3in a Helm graphH_n are prime cordial graphs.

APA, Harvard, Vancouver, ISO, and other styles

20

Gulab Minj, Dibya, G. V. V. Jagannadha Rao, and Chiranjilal Kujur. "SUM CORDIAL LABELING OF CORONA PRODUCT GRAPH OF PATH TO PATH." International Journal of Advanced Research 11, no. 08 (2023): 410–14. http://dx.doi.org/10.21474/ijar01/17405.

Full text

Abstract:

In this paper the researcher studies on the labeling of Corona Product Graph of Path to Path by admitting the certain condition of Sum cordial labeling. A sum cordial labeling of a graph is a binary labeling with vertex set V, with edge labeling f:E(G) {0,1},defined by f(uv)=(f(u)+f(v))(mod2) if |vf(0)-vf(1)|â‰¤1and |ef(0)-ef(1)|â‰¤1. A graph G is Sum cordial if it admits Sum cordial labeling.

APA, Harvard, Vancouver, ISO, and other styles

21

Abdel-Aal, M. E., and S. A. Bashammakh. "A study on the varieties of equivalent cordial labeling graphs." AIMS Mathematics 9, no. 12 (2024): 34720–33. https://doi.org/10.3934/math.20241653.

Full text

Abstract:

<p>The concepts of cordial labeling, signed product cordiality, and logical cordiality have been introduced independently by different researchers as distinct labeling schemes. In this paper, we demonstrate the equivalence of these concepts. Specifically, we prove that a graph $ G $ is cordial if and only if it is signed product cordial, if and only if it is logically cordial. Additionally, we establish that a graph $ G $ admits permuted cordial labeling if and only if it exhibits cubic roots cordial labeling. Furthermore, we leverage this newfound equivalence to analyze the cordiality p

APA, Harvard, Vancouver, ISO, and other styles

22

Beasley, LeRoy B. "Cordial Digraphs." Journal of Combinatorial Mathematics and Combinatorial Computing 121, no. 1 (2024): 59–66. http://dx.doi.org/10.61091/jcmcc121-06.

Full text

Abstract:

A ( 0 , 1 ) -labeling of a set is said to be friendly if the number of elements of the set labeled 0 and the number labeled 1 differ by at most 1. Let g be a labeling of the edge set of a graph that is induced by a labeling f of the vertex set. If both g and f are friendly then g is said to be a cordial labeling of the graph. We extend this concept to directed graphs and investigate the cordiality of directed graphs. We show that all directed paths and all directed cycles are cordial. We also discuss the cordiality of oriented trees and other digraphs.

APA, Harvard, Vancouver, ISO, and other styles

23

Hasni, Roslan. "Some results on cordiality labeling of generalized Jahangir graph." Indonesian Journal of Combinatorics 1, no. 2 (2017): 1. http://dx.doi.org/10.19184/ijc.2017.1.2.1.

Full text

Abstract:

In this paper we consider the cordiality of a generalized Jahangir graph $J_{n,m}$. We give sufficient condition for $J_{n,m}$ to admit (or not admit) the prime cordial labeling, product cordial labeling and total product cordial labeling.

APA, Harvard, Vancouver, ISO, and other styles

24

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

25

Vaidya, S. K., and N. H. Shah. "On Square Divisor Cordial Graphs." Journal of Scientific Research 6, no. 3 (2014): 445–55. http://dx.doi.org/10.3329/jsr.v6i3.16412.

Full text

Abstract:

The square divisor cordial labeling is a variant of cordial labeling and divisor cordial labeling. Here we prove that the graphs like flower Fln, bistar Bn,n, square graph of Bn,n, shadow graph of Bn,n as well as splitting graphs of star Kl,n and bistar Bn,n are square divisor cordial graphs. Moreover we show that the degree splitting graphs of Bn,n and Pn admit square divisor cordial labeling. © 2014 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved.doi: http://dx.doi.org/10.3329/jsr.v6i3.16412 J. Sci. Res. 6 (3), 445-455 (2014)

APA, Harvard, Vancouver, ISO, and other styles

26

Barasara, C. M., and Y. B. Thakkar. "DIVISOR CORDIAL LABELING FOR SOME SNAKES AND DEGREE SPLITTING RELATED GRAPHS." South East Asian J. of Mathematics and Mathematical Sciences 19, no. 01 (2023): 211–24. http://dx.doi.org/10.56827/seajmms.2023.1901.17.

Full text

Abstract:

For a graph G = (V (G),E(G)), the vertex labeling function is defined as a bijection f : V (G) → {1, 2, . . . , |V (G)|} such that an edge uv is assigned the label 1 if one f(u) or f(v) divides the other and 0 otherwise. f is called divisor cordial labeling of graph G if the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In 2011, Varatharajan et al. [24] have introduced divisor cordial labeling as a variant of cordial labeling. In this paper, we study divisor cordial labeling for triangular snake and quadrilateral snake. Moreover, we investigate divi

APA, Harvard, Vancouver, ISO, and other styles

27

R., Ponraj*1 S. Yesu Doss Philip2 &. R. Kala3. "3-TOTAL DIFFERENCE CORDIAL LABELING OF SOME GRAPHS." GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES 6, no. 5 (2019): 46–51. https://doi.org/10.5281/zenodo.2677915.

Full text

Abstract:

We introduce a new graph labeling technique called k- total difference cordial labeling .Let f:V(G)→{0,1,2,..,k-1} be a map where  k ε N and k>1.For each edge uv assign the label │f(u)-f(v)│,f is called k-total difference cordial labeling of G if  │t<sub>df</sub>(i)- t<sub>df</sub>(j)│≤1, i,jε{0,1,,2,……k-1} where t<sub>df</sub>(x) denote the total number of vertices and the edges labeled with x. A Graph with a k- total difference cordial labeling is called k- total difference cordial graph. We investigate k-total difference  cordial label

APA, Harvard, Vancouver, ISO, and other styles

28

Barasara, C. M., and Y. B. Thakkar. "Some Characterizations and NP-Complete Problems for Power Cordial Graphs." Journal of Mathematics 2023 (July 15, 2023): 1–5. http://dx.doi.org/10.1155/2023/2257492.

Full text

Abstract:

A power cordial labeling of a graph G = V G , E G is a bijection f : V G ⟶ 1,2 , … , V G such that an edge e = u v is assigned the label 1 if f u = f v n or f v = f u n , for some n ∈ N ∪ 0 and the label 0 otherwise, and satisfy the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. The graph that admits power cordial labeling is called a power cordial graph. In this paper, we derive some characterizations of power cordial graphs as well as explore NP-complete problems for power cordial labeling. This work also rules out any possibility of forbidden subg

APA, Harvard, Vancouver, ISO, and other styles

29

Irene, Yanne, Winda Ayu Mei Lestari, Mahmudi Mahmudi, Muhammad Manaqib, and Gustina Elfiyanti. "Product Cordial Labeling Of Scale Graph S_{1,r}\left(C_3\right) For r\geq3." Mathline : Jurnal Matematika dan Pendidikan Matematika 9, no. 4 (2024): 1073–87. https://doi.org/10.31943/mathline.v9i4.662.

Full text

Abstract:

Graph theory plays a crucial role in various fields, including communication systems, computer networks, and integrated circuit design. One important aspect of this theory is product cordial labeling, which involves assigning labels to the vertices and edges of a graph in a specific way to achieve a balance. Despite extensive research, the product cordial labeling of scale graphs has not been thoroughly explored. This study aims to fill this gap by investigating whether the scale graph can be labeled in a product cordial manner. To achieve this, we followed a three-step methodology: first, we

APA, Harvard, Vancouver, ISO, and other styles

30

Gulab Minj, Dibya, G. V. V. Jagannadha Rao, and Chiranjilal Kujur. "SMARANDACHLEY PRODUCT CORDIAL LABELING OF BLOOM TORUS GRAPH (BT M,N)." International Journal of Advanced Research 11, no. 02 (2023): 705–12. http://dx.doi.org/10.21474/ijar01/16302.

Full text

Abstract:

In this paper we work on the Bloom Torus graph by satisfying the condition of Smarandachely product cordial labeling. Smarandachely product cordial labeling on is such a labeling with induced labeling

APA, Harvard, Vancouver, ISO, and other styles

31

Sathakathulla, ِA A. "Enabling Cordial, Edge cordial and total cordial labeling of dragon curve fractal graph." International Journal of Algebra and Statistics 3, no. 1 (2014): 9. http://dx.doi.org/10.20454/ijas.2014.773.

Full text

Abstract:

A fractal is a mathematical set that typically displays self similar patterns. The dragon curves (Also Known as Highway dragon) was the first in this family and further, it lead to other studies too. For our study, this fractal has been considered as a graph and the same has been tested with enabling the labeling of cordial, edge cordial and total cordial labeling, and which may lead to continue the applied studies further.

APA, Harvard, Vancouver, ISO, and other styles

32

Ivančo, Jaroslav. "On edge product cordial graphs." Opuscula Mathematica 39, no. 5 (2019): 691–703. http://dx.doi.org/10.7494/opmath.2019.39.5.691.

Full text

Abstract:

An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize graphs admitting an edge product cordial labeling. Using this characterization we investigate the edge product cordiality of broad classes of graphs, namely, dense graphs, dense bipartite graphs, connected regular graphs, unions of some graphs, direct products of some bipartite graphs, joins of some graphs, maximal \(k\)-degenerate and related graphs, product cordial graphs.

APA, Harvard, Vancouver, ISO, and other styles

33

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

34

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 − 𝑝 2 . . 𝑝 2 &lowast; or − 𝑝 2 . . 𝑝 2 as p is even or odd, which induces an edge labeling f * : E → {0, 1} defined by f * (uv) = 1 if f(u) + f(v) ≥ 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

35

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

36

Vaidya, S. K., and N. H. Shah. "Some New Results on Prime Cordial Labeling." ISRN Combinatorics 2014 (March 23, 2014): 1–9. http://dx.doi.org/10.1155/2014/607018.

Full text

Abstract:

A prime cordial labeling of a graph G with the vertex set V(G) is a bijection f:V(G)→{1,2,3,…,|V(G)|} such that each edge uv is assigned the label 1 if gcd(f(u),f(v))=1 and 0 if gcd(f(u),f(v))>1; then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph which admits a prime cordial labeling is called a prime cordial graph. In this work we give a method to construct larger prime cordial graph using a given prime cordial graph G. In addition to this we have investigated the prime cordial labeling for double fan and degree splitting graphs of p

APA, Harvard, Vancouver, ISO, and other styles

37

G. Megala and K. Annadurai. "k-TRIANGULAR PRIME CORDIAL LABELING OF MAXIMAL OUTERPLANAR GRAPHS." jnanabha 52, no. 02 (2022): 126–37. http://dx.doi.org/10.58250/jnanabha.2022.52215.

Full text

Abstract:

In this paper, we study graph labeling, namely, k- triangular prime cordial labeling for k = 1, 2, 3, 4, 5, 6. This is a simple extension of prime cordial labeling where the vertex labels are defined as the higher order triangular numbers. Also we show that the maximal outerplanar graphs are k- triangular prime cordial under certain conditio

APA, Harvard, Vancouver, ISO, and other styles

38

S. Pasunkili Pandian, J. Maruthamani,. "Union Of 4-Total Prime Cordial Graph G With The Bistar Bn,N." Proceeding International Conference on Science and Engineering 11, no. 1 (2023): 2195–205. http://dx.doi.org/10.52783/cienceng.v11i1.396.

Full text

Abstract:

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k ∈ N is a variable and k > 1. For each edge uv, assign the label gcd(f (u), f (v)). The map f is called a k- Total prime cordial labeling of G if |tpf (i) − tpf (j)| ≤ 1, i, j ∈ {1, 2, · · · , k} where tpf (x) denotes the total number of vertices and the edges labelled with x. A graph with a k-total prime cordial labeling is called k-total prime cordial graph. In this paper we investigate the 4-total prime cordial labeling of G ∪ Bn,n, where G has a 4-total prime cordial labeling and Bn,n is a bistar.

APA, Harvard, Vancouver, ISO, and other styles

39

Ariel C. Pedrano and Ricky F. Rulete. "On the total product cordial labeling on the cartesian product of $P_m \times C_n$, $C_m \times C_n$ and the generalized Petersen graph $P(m, n)$." Malaya Journal of Matematik 5, no. 03 (2017): 531–39. http://dx.doi.org/10.26637/mjm503/007.

Full text

Abstract:

A total product cordial labeling of a graph $G$ is a function $f: V \rightarrow\{0,1\}$. For each $x y$, assign the label $f(x) f(y), f$ is called total product cordial labeling of $G$ if it satisfies the condition that $\mid v_f(0)+e_f(0)-$ $v_f(1)-e_f(1) \mid \leq 1$ where $v_f(i)$ and $e_f(i)$ denote the set of vertices and edges which are labeled with $i=0,1$, respectively. A graph with a total product cordial labeling defined on it is called total product cordial. In this paper, we determined the total product cordial labeling of the cartesian product of $P_m \times C_n, C_m \times

APA, Harvard, Vancouver, ISO, and other styles

40

Lourdusamy, A., and F. Patrick. "Some results on SD-Prime cordial labeling." Proyecciones (Antofagasta) 36, no. 4 (2025): 601–14. https://doi.org/10.22199/issn.0717-6279-2538.

Full text

Abstract:

Given a bijection ʄ : V(G) → {1,2, …,|V(G)|}, we associate 2 integers S = ʄ(u)+ʄ(v) and D = |ʄ(u)-ʄ(v)| with every edge uv in E(G). The labeling ʄ induces an edge labeling ʄ'' : E(G) → {0,1} such that for any edge uv in E(G), ʄ '(uv)=1 if gcd(S,D)=1, and ʄ ' (uv)=0 otherwise. Let eʄ ' (i) be the number of edges labeled with i ∈ {0,1}. We say ʄ is SD-prime cordial labeling if |eʄ '(0)-e ʄ' (1)| ≤ 1. Moreover G is SD-prime cordial if it admits SD-prime cordial labeling. In this paper, we investigate the SD-prime cordial labeling of some derived graphs.

APA, Harvard, Vancouver, ISO, and other styles

41

R., Shankar* R. Uma. "SQUARE DIVISOR CORDIAL LABELING FOR SOME GRAPHS." INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY 5, no. 10 (2016): 726–30. https://doi.org/10.5281/zenodo.163293.

Full text

Abstract:

Let G = {V (G), E (G)} be a simple graph and f: v→ {1, 2. . . |v|} be a bijection. For each edge uv, assign the label 1. If either or and the label 0 otherwise f is called a square divisor cordial labeling if. A graph with a square divisor cordial labeling is called a square divisor cordial graph. In this work, a discussion is made on Shell, Tensor product, Coconut tree, Jelly fish and Subdivision of bistar under square divisor cordial labeling.

APA, Harvard, Vancouver, ISO, and other styles

42

Inayah, N., A. Erfanian, and M. Korivand. "Total Product and Total Edge Product Cordial Labelings of Dragonfly Graph D g n." Journal of Mathematics 2022 (November 15, 2022): 1–6. http://dx.doi.org/10.1155/2022/3728344.

Full text

Abstract:

In this paper, we study the total product and total edge product cordial labeling for dragonfly graph D g n . We also define generalized dragonfly graph and find product cordial and total product cordial labeling for this family of graphs.

APA, Harvard, Vancouver, ISO, and other styles

43

ELrokh, Ashraf, Mohammed M. Ali Al-Shamiri, Shokry Nada, and Atef Abd El-hay. "Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate Graphs." Journal of Mathematics 2022 (May 5, 2022): 1–9. http://dx.doi.org/10.1155/2022/8521810.

Full text

Abstract:

A simple graph is called cordial if it admits 0-1 labeling that satisfies certain conditions. The second order of lemniscate graph is a graph of two second order of circles that have one vertex in common. In this paper, we introduce some new results on cordial labeling, total cordial, and present necessary and sufficient conditions of cordial and total cordial for corona product of paths and second order of lemniscate graphs.

APA, Harvard, Vancouver, ISO, and other styles

44

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> To analyse cordial labelling of subdivision of central edge of bistar graph and Spider graph. <strong>Methods:</strong> 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’s and 1’s, similarly eg (0) and eg (1) signify the number of edges with 0’s and 1’s. <strong>Findings:</strong> In this paper, it is proved that subdivisi

APA, Harvard, Vancouver, ISO, and other styles

45

Annie Lydia A and Angel Jebitha MK. "Perfect Mean Cordial Labeling of [Pn : Sk ] Graphs." Journal of Computational Mathematica 7, no. 1 (2023): 073–99. http://dx.doi.org/10.26524/cm164.

Full text

Abstract:

A vertex labeling h : V(G) → {0,1,2,3} is said to be perfect mean cordial labeling of a graph G if it induces an edge labeling h∗ defined as follows : with the condition that |eh(0)−eh(1)| ≤ 1 and |vh(α)−vh(β)| ≤ 1 for all α,β ∈ {0,1,2,3},where eh(δ) is number of edges label with δ(δ = 0,1) and vh(λ) denote the number of vertices labeled with λ (λ = 0,1,2,3). A graph G is said to be perfect mean cordial graph if it admits a perfect mean cordial labeling. In this paper, we investigate [Pn : Sk ] graphs are perfect mean cordial graphs.

APA, Harvard, Vancouver, ISO, and other styles

46

Kuo, David, Gerard J. Chang, and Y. H. Harris Kwong. "Cordial labeling of mKn." Discrete Mathematics 169, no. 1-3 (1997): 121–31. http://dx.doi.org/10.1016/s0012-365x(95)00336-u.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Cichacz, Sylwia, Agnieszka Görlich, and Zsolt Tuza. "Cordial labeling of hypertrees." Discrete Mathematics 313, no. 22 (2013): 2518–24. http://dx.doi.org/10.1016/j.disc.2013.07.025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Cynthia, V. Jude Annie, and E. Padmavathy. "SIGNED CORDIAL LABELING AND SIGNED PRODUCT CORDIAL LABELING OF SOME INTERCONNECTION NETWORKS." Advances and Applications in Discrete Mathematics 26, no. 1 (2021): 35–51. http://dx.doi.org/10.17654/dm026010035.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Thamizharasi, R., and R. Rajeswari. "Edge product Cordial Labeling and Total Magic Cordial Labeling of Regular Digraphs." International Journal on Information Sciences and Computing 9, no. 2 (2015): 1–4. http://dx.doi.org/10.18000/ijisac.50153.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Ahmad, Yasir, Umer Ali, Muhammad bilal, Sohail Zafar, and Zohaib Zahid. "Some new standard graphs labeled by 3–total edge product cordial labeling." Applied Mathematics and Nonlinear Sciences 2, no. 1 (2017): 61–72. http://dx.doi.org/10.21042/amns.2017.1.00005.

Full text

Abstract:

AbstractIn this paper, we study 3–total edge product cordial (3–TEPC) labeling which is a variant of edge product cordial labeling. We discuss Web, Helm, Ladder and Gear graphs in this context of 3–TEPC labeling. We also discuss 3–TEPC labeling of some particular examples with corona graph.

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!