Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Total edge product cordial labeling of graphs
View through CrossRef
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.
Title: Total edge product cordial labeling of graphs
Description:
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.
Related Results
On Vector Basis S-Cordial Graph
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...
Harmonic Mean Cordial Labeling of Some Known Graphs
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)...
Product of digraphs, (super) edge-magic valences and related problems
Product of digraphs, (super) edge-magic valences and related problems
Discrete Mathematics, and in particular Graph Theory, has gained a lot of popularity during the last 7 decades. Among the many branches in Graph Theory, graph labelings has experim...
Magic graphs
Magic graphs
DE LA TESIS<br/>Si un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf super edge màgic. La tesis està principalment enfocada a l'estudi del c...
FP-cordial labeling of product and corona-related graphs
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 ...
Fibonacci Prime Labelling on the Class of Flower Graphs
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
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
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...