Javascript must be enabled to continue!

FP-cordial labeling of product and corona-related graphs

Let [Formula: see text] be a [Formula: see text] graph. Let [Formula: see text] Let [Formula: see text] be a bijection. For each edge [Formula: see text], assign the label [Formula: see text].[Formula: see text] is called a fractional product cordial labeling (simply called FP-cordial labeling) if [Formula: see text] where [Formula: see text] and [Formula: see text] respectively, denotes the number of edges labelled with [Formula: see text] and not labelled with [Formula: see text]. A graph with a fractional product cordial labeling is called a fractional product cordial graph (Simply FP-cordial graph). In this paper, we investigate the fractional product cordial labeling behavior of planar grid graph, [Formula: see text], mongolian tent graph, double arrow graph, [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text].

World Scientific Pub Co Pte Ltd

R. Ponraj T. Sutharson

Discrete Mathematics, Algorithms and Applications

2026

Title: FP-cordial labeling of product and corona-related graphs

Description:

Let [Formula: see text] be a [Formula: see text] graph.

Let [Formula: see text] Let [Formula: see text] be a bijection.

For each edge [Formula: see text], assign the label [Formula: see text].

[Formula: see text] is called a fractional product cordial labeling (simply called FP-cordial labeling) if [Formula: see text] where [Formula: see text] and [Formula: see text] respectively, denotes the number of edges labelled with [Formula: see text] and not labelled with [Formula: see text].

A graph with a fractional product cordial labeling is called a fractional product cordial graph (Simply FP-cordial graph).

In this paper, we investigate the fractional product cordial labeling behavior of planar grid graph, [Formula: see text], mongolian tent graph, double arrow graph, [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text].

Back

Related Results

KECEMASAN SAAT PANDEMI COVID 19: LITERATUR REVIEW Hardiyati, Efri Widianti, Taty Hernawaty Departemen Keperawatan Jiwa Poltekkes Kemenkes Mamuju Sulbar, Universitas Pad...

On Vector Basis S-Cordial Graph

Let be a graph. Let be an inner product space with basis . We denote the inner product of the vectors x and y by Let be a function. For each edge assign the label. We say tha...

Total edge product cordial labeling of graphs

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 ...

Harmonic Mean Cordial Labeling of Some Known Graphs

All graphs considered in this paper are simple, finite, and undirected. A function f:V(G)→{1,2} is said to be a harmonic mean cordial labeling if the induced edge labeling f^*:E(G)...

Fibonacci Prime Labelling on the Class of Flower Graphs

Graph labeling is one of the significant topics in graph theory. One of its interesting variants is Fibonacci prime labeling, a special type of labeling that assigns Fibonacci numb...

Some Characterizations and NP-Complete Problems for Power Cordial Graphs

A power cordial labeling of a graph G = ...

Group mean cordial labeling of some splitting graphs

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...

Exploring fibonacci cordiality in corona graphs

A Fibonacci cordial (FC) labeling of a graph G is an injective function f : V(G) → {F0, F1, …, Fn}, where Fi is the ith Fibonacci number, such that the induced edge labeling f*(uv)...

Email:
Password:

Email: