Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
On Vertex, Edge Matrix Cordial Labeling
View through CrossRef
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 assign the Matrix Cordial Labeling to the vertices. In this paper we introduce the concept of Matrix Cordial labeling for some splitting graphs We shall discuss Matrix Cordial Labeling for path, cycle .
Conclusions: In this paper we investigated three new matrix cordial graphs. The findings in this paper are original. For a better understanding of the labeling pattern specified in each theorem, illustrations are given at the conclusion of each theorem.
Title: On Vertex, Edge Matrix Cordial Labeling
Description:
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 assign the Matrix Cordial Labeling to the vertices.
In this paper we introduce the concept of Matrix Cordial labeling for some splitting graphs We shall discuss Matrix Cordial Labeling for path, cycle .
Conclusions: In this paper we investigated three new matrix cordial graphs.
The findings in this paper are original.
For a better understanding of the labeling pattern specified in each theorem, illustrations are given at the conclusion of each theorem.
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...
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
For a connected graph G = (V, E), a set Se ⊆ E(G)–{e} is called an edge fixing edge-to-vertex monophonic set of an edge e of a connected graph G if every vertex of G lies on an e –...
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...
Total Distance Vertex Irregularity Strength of Hairy Cycle C_m^n Graph
Total Distance Vertex Irregularity Strength of Hairy Cycle C_m^n Graph
A total graph labeling is an assignment of integers to the union of vertices and edges to certain conditions. The labeling becomes D -distance vertex irregular total k-labeling whe...
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...
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)...
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
=
...