Search engine for discovering works of Art, research articles, and books related to Art and Culture
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
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...
N‐Terminal Protein Labeling with N‐Hydroxysuccinimide Esters and Microscale Thermophoresis Measurements of Protein‐Protein Interactions Using Labeled Protein
N‐Terminal Protein Labeling with N‐Hydroxysuccinimide Esters and Microscale Thermophoresis Measurements of Protein‐Protein Interactions Using Labeled Protein
AbstractProtein labeling strategies have been explored for decades to study protein structure, function, and regulation. Fluorescent labeling of a protein enables the study of prot...
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...
Obligation by religation. A complementary reading of Adela Cortina's cordial ethics and Xavier Zubiri's analysis of social reality
Obligation by religation. A complementary reading of Adela Cortina's cordial ethics and Xavier Zubiri's analysis of social reality
In her Ethics of Cordial Reason, Adela Cortina proposes a “cordial bond” as the foundation of moral obligation: a bond between people, deeply felt and intuitively known, which lead...
Protocol for antigen labeling in eukaryotic cells and quantification by flow cytometry v1
Protocol for antigen labeling in eukaryotic cells and quantification by flow cytometry v1
Goal: This document aims to standardize the protocol used for labeling intracellular or extracellular antigens in eukaryotic cells, using antibodies already associated with fluoroc...
Exploring fibonacci cordiality in corona graphs
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)...