Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

PAIR MEAN CORDIAL LABELING OF HURDLE, KEY, LOTUS, AND NECKLACE GRAPHS

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 18 No. 4 (2024) · hlm. 2795–2804

DOI
10.30598/barekengvol18iss4pp2795-2804
ISSN
2615-3017, 1978-7227
Terbit
2024-10-14
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Let be a graph with vertices and edges. Define and. Consider a mapping by assigning different labels in to the different elements of when is even and different labels in to elements of V and repeating a label for the remaining one vertex when is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge of G, there exists a labeling if is even and if is odd such that | |≤1 where and respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G for which there is a pair mean cordial labeling is called pair mean cordial graph(PMC-graph). In this paper, we investigate the pair mean cordial labeling of some graphs like hurdle graph, lotus graph, necklace graph, F-tree, Y-tree, subdivided shell graph, uniform bow graph and key graph.

Jaringan kolaborasi para penulis

4 penulis · 4 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Manonmaniam Sundaranar University
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
S PrabhuAfiliasi tidak diketahui1
M. SivakumarAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PAIR MEAN CORDIAL LABELING OF HURDLE, KEY, LOTUS, AND NECKLACE GRAPHS</dc:title>
	<dc:creator>Ponraj, R</dc:creator>
	<dc:creator>Prabhu, S</dc:creator>
	<dc:description xml:lang="en-US">Let  &amp;nbsp;be a graph with  &amp;nbsp;vertices and  &amp;nbsp;edges. Define and  . Consider a mapping  &amp;nbsp;by assigning different labels in  &amp;nbsp;to the different elements of  &amp;nbsp;when  is even and different labels in  &amp;nbsp;to  elements of V and repeating a label for the remaining one vertex when  &amp;nbsp;is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge  &amp;nbsp;of G, there exists a labeling  &amp;nbsp; if  &amp;nbsp;is even and  &amp;nbsp; if  &amp;nbsp;is odd such that | |≤1 where  &amp;nbsp;and  &amp;nbsp;respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G for which there is a pair mean cordial labeling is called pair mean cordial graph(PMC-graph). In this paper, we investigate the pair mean cordial labeling of some graphs like hurdle graph, lotus graph, necklace graph, F-tree, Y-tree, subdivided shell graph, uniform bow graph and key graph.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-10-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/14934</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss4pp2795-2804</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 18 No 4 (2024): BAREKENG: Journal of Mathematics and Its Application; 2795-2804</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol18iss4year2024</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/14934/8917</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 R Ponraj, S Prabhu</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>