- Tytuł:
- Edge product cordial labeling of some graphs
- Autorzy:
-
Prajapati, U.M.
Patel, N.B. - Powiązania:
- https://bibliotekanauki.pl/articles/122496.pdf
- Data publikacji:
- 2019
- Wydawca:
- Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
- Tematy:
-
graph labeling
edge product cordial labeling
teoria grafów
etykietowanie wykresów
kordialne oznaczenie produktu - Opis:
- For a graph G = (V(G),E(G)) having no isolated vertex, a function ƒ : E(G)→{0;1} 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 be such that the number of edges with label 0 and the number of edges with label 1 differ by at the most 1 and the number of vertices with label 0 and the number of vertices with label 1 also differ by at the most 1. In this paper we discuss the edge product cordial labeling of the graphs Wn(t), PSn and DPSn.
- Źródło:
-
Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 1; 69-76
2299-9965 - Pojawia się w:
- Journal of Applied Mathematics and Computational Mechanics
- Dostawca treści:
- Biblioteka Nauki
Artykuł