Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

SP Mean E-Cordial Labeling

View through CrossRef
Assigning an integer to a vertices or edges is called a vertex or edge labeling respectively. Suppose G is a simple graph. Consider the function f  for the edge set . For each vertex t , define f(t)= (mod2). The function f is known as an E-cordial labeling (E-CL) of G if , and  where , and ,  are the number of edges and vertices labeled with 0 and labeled by 1 respectively. A graph that admits E-CL is said to be E-cordial graphs (E-CG).  Based on the above definition we propose a novel labeling known as SP Mean E-cordial labeling (E-CL). In this paper, we study SP Mean E-CL of several families of graphs such as complete bipartite graphs, complete graphs, wheels, etc.
Title: SP Mean E-Cordial Labeling
Description:
Assigning an integer to a vertices or edges is called a vertex or edge labeling respectively.
Suppose G is a simple graph.
Consider the function f  for the edge set .
For each vertex t , define f(t)= (mod2).
The function f is known as an E-cordial labeling (E-CL) of G if , and  where , and ,  are the number of edges and vertices labeled with 0 and labeled by 1 respectively.
A graph that admits E-CL is said to be E-cordial graphs (E-CG).
  Based on the above definition we propose a novel labeling known as SP Mean E-cordial labeling (E-CL).
In this paper, we study SP Mean E-CL of several families of graphs such as complete bipartite graphs, complete graphs, wheels, etc.

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)...
As Raízes e o Futuro do “Homem Cordial” Segundo Sérgio Buarque de Holanda
As Raízes e o Futuro do “Homem Cordial” Segundo Sérgio Buarque de Holanda
O texto faz uma análise do método utilizado por Sérgio Buarque de Holanda e de seu conceito de Homem Cordial, ...
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...
Active Learning Query by Committee Labeling Method to Increase Accuracy and Efficiency of Sentiment Analysis Classification
Active Learning Query by Committee Labeling Method to Increase Accuracy and Efficiency of Sentiment Analysis Classification
This study proposes the Query by Committee (QBC) labeling method to improve the accuracy of classification models—specifically XLM-RoBERTa—and to increase labeling efficiency compa...
PELABELAN PRIME CORDIAL PADA GRAF MIDDLE
PELABELAN PRIME CORDIAL PADA GRAF MIDDLE
Pelabelan graf adalah pemetaan yang memasangkan unsur-unsur graf dengan suatu himpunan bilangan. Bilangan-bilangan tersebut disebut label. Ada banyak jenis pelabelan graf yang tela...
PMC-graphs derived from cycles
PMC-graphs derived from cycles
The graph $G=(V,E)$ consists of $p$ vertices and $q$ edges. Let \begin{align*} \rho =\left\{ \begin{array}{ccc} \frac {p} {2},&\mbox {\rm $p$ is even} \\ \frac {p-1}{2}, &...

Back to Top