For a graph having no isolated vertex, a function is called an edge product cordial labeling of graph G, if the induced vertex labeling function defined by the product of labels of incident edges to each vertex is suc...For a graph having no isolated vertex, a function is called an edge product cordial labeling of graph G, if the induced vertex labeling function defined by the product of labels of incident edges to each vertex is such that the number of edges with label 0 and the number of edges with label 1 differ by at most 1 and the number of vertices with label 0 and the number of vertices with label 1 also differ by at most 1. In this paper, we discuss edge product cordial labeling for some cycle related graphs.展开更多
A graph is said to be a product cordial graph if there exists a function with each edge assign the label , such that the number of vertices with label 0 and the number of vertices with label 1 differ atmost by 1, and ...A graph is said to be a product cordial graph if there exists a function with each edge assign the label , such that the number of vertices with label 0 and the number of vertices with label 1 differ atmost by 1, and the number of edges with label 0 and the number of edges with label 1 differ by atmost 1. We discuss the product cordial labeling of the graphs obtained by duplication of some graph elements of gear graph. Also, we derive some product cordial graphs obtained by vertex switching operation on gear graph.展开更多
For a graph, a function is called an edge product cordial labeling of G, if the induced vertex labeling function is defined by the product of the labels of the incident edges as such that the number of edges with labe...For a graph, a function is called an edge product cordial labeling of G, if the induced vertex labeling function is defined by the product of the labels of the incident edges as such that the number of edges with label 1 and the number of edges with label 0 differ by at most 1 and the number of vertices with label 1 and the number of vertices with label 0 differ by at most 1. In this paper, we show that the graphs obtained by duplication of a vertex, duplication of a vertex by an edge or duplication of an edge by a vertex in a crown graph are edge product cordial. Moreover, we show that the graph obtained by duplication of each of the vertices of degree three by an edge in a gear graph is edge product cordial. We also show that the graph obtained by duplication of each of the pendent vertices by a new vertex in a helm graph is edge product cordial.展开更多
文摘For a graph having no isolated vertex, a function is called an edge product cordial labeling of graph G, if the induced vertex labeling function defined by the product of labels of incident edges to each vertex is such that the number of edges with label 0 and the number of edges with label 1 differ by at most 1 and the number of vertices with label 0 and the number of vertices with label 1 also differ by at most 1. In this paper, we discuss edge product cordial labeling for some cycle related graphs.
文摘A graph is said to be a product cordial graph if there exists a function with each edge assign the label , such that the number of vertices with label 0 and the number of vertices with label 1 differ atmost by 1, and the number of edges with label 0 and the number of edges with label 1 differ by atmost 1. We discuss the product cordial labeling of the graphs obtained by duplication of some graph elements of gear graph. Also, we derive some product cordial graphs obtained by vertex switching operation on gear graph.
文摘For a graph, a function is called an edge product cordial labeling of G, if the induced vertex labeling function is defined by the product of the labels of the incident edges as such that the number of edges with label 1 and the number of edges with label 0 differ by at most 1 and the number of vertices with label 1 and the number of vertices with label 0 differ by at most 1. In this paper, we show that the graphs obtained by duplication of a vertex, duplication of a vertex by an edge or duplication of an edge by a vertex in a crown graph are edge product cordial. Moreover, we show that the graph obtained by duplication of each of the vertices of degree three by an edge in a gear graph is edge product cordial. We also show that the graph obtained by duplication of each of the pendent vertices by a new vertex in a helm graph is edge product cordial.