Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Some results on E cordial labeling of hypercube related graphs
View through CrossRef
All the graphs considered in this article are finite, simple and undirected. In this paper we have proved that the hypercube graph, path union of the hypercube graphs, open star of hypercube graphs, one point union of path of hypercube graphs are E Cordial.
MKD Publishing House
Title: Some results on E cordial labeling of hypercube related graphs
Description:
All the graphs considered in this article are finite, simple and undirected.
In this paper we have proved that the hypercube graph, path union of the hypercube graphs, open star of hypercube graphs, one point union of path of hypercube graphs are E Cordial.
Related Results
Total edge product cordial labeling of graphs
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 ...
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)...
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
=
...
Optimization of television hyperspectral system
Optimization of television hyperspectral system
Optimization of a television hyperspectral system requires compromises related to the need to obtain high contrast sensitivity and sufficient resolution, signal-to-noise ratio, as ...
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...
On Vertex, Edge Matrix Cordial Labeling
On Vertex, Edge Matrix Cordial Labeling
Let G be a simple undirected graph whose vertices are from non cyclic abelian group and there is an edge between any two vertices iff vertices form a non singular matrix. Here we...