Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Product cordial labeling of hypercube related graphs
View through CrossRef
In this paper we investigate the product cordial labeling of hypercube graph, path union of the hypercube graphs, \(S\left(t, P_n\right), P_n^t\left(t_n, Q_k\right)\) and graph obtained by joining two copies of hypercube by arbitrary length of path.
MKD Publishing House
Title: Product cordial labeling of hypercube related graphs
Description:
In this paper we investigate the product cordial labeling of hypercube graph, path union of the hypercube graphs, \(S\left(t, P_n\right), P_n^t\left(t_n, Q_k\right)\) and graph obtained by joining two copies of hypercube by arbitrary length of path.
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)...
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 results on E cordial labeling of hypercube related graphs
Some results on E cordial labeling of hypercube related graphs
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...
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...
SP Mean E-Cordial Labeling
SP Mean E-Cordial Labeling
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 vert...
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, ...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...