On some graph-cordial abelian groups
From MaRDI portal
Publication:2113373
Abstract: Hovey introduced -cordial labelings as a generalization of cordial and harmonious labelings cite{Hovey}. If is an Abelian group, then a labeling of the vertices of some graph induces an edge labeling on ; the edge receives the label . A graph is -cordial if there is a vertex-labeling such that (1) the vertex label classes differ in size by at most one and (2) the induced edge label classes differ in size by at most one. Patrias and Pechenik studied the larger class of finite abelian groups such that all path graphs are -cordial. They posed a conjecture that all but finitely many paths graphs are -cordial for any Abelian group . In this paper we solve this conjecture. Moreover we show that all cycle graphs are -cordial for any Abelian group of odd order.
Recommendations
Cites work
- \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs
- \(R\)-sequenceability and \(R^*\)-sequenceability of Abelian 2-groups
- A Combinatorial Problem on Abelian Groups
- A-cordial graphs
- Complete mappings of finite groups
- Cordial labeling of hypertrees
- Generalized graph cordiality
- Harmonious groups
- scientific article; zbMATH DE number 3632772 (Why is no real title available?)
- scientific article; zbMATH DE number 1343076 (Why is no real title available?)
- scientific article; zbMATH DE number 3997850 (Why is no real title available?)
- On orthogonal Latin squares
- On sequential labelings of graphs
- Partitions of groups and complete mappings
- Path-cordial abelian groups
- Sums and differences along Hamiltonian cycles
Cited in
(11)- A-cordial graphs
- On abelian \(\ell\)-towers of multigraphs
- Some new results on k-cordial labeling.
- Finite abelian group labeling of graphs
- Generalized graph cordiality
- Path-cordial abelian groups
- On abelian -towers of multigraphs. II
- Klein cordial trees and odd cyclic cordial friendship graphs
- The cordiality game and the game cordiality number
- E_A-cordial labeling of graphs and its implications for A-antimagic labeling of trees
- Graphically abelian groups
This page was built for publication: On some graph-cordial abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113373)