A-cordial graphs
From MaRDI portal
Publication:1182892
DOI10.1016/0012-365X(91)90254-YzbMath0753.05059MaRDI QIDQ1182892
Publication date: 28 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
A guide to the graph labeling zoo, Group sum chromatic number of graphs, On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\), Cordial labeling of \(mK_ n\), On full friendly index sets of 1-level and 2-levels N-grids, Rainbow spanning trees in abelian groups, Unnamed Item, Path-cordial abelian groups, On 3-total edge product cordial labeling of a carbon nanotube network, On \(3\)-total edge product cordial labeling of honeycomb, Full friendly index set. I, Cordial labeling of hypertrees, Klein cordial trees and odd cyclic cordial friendship graphs, A new approach in finding full friendly indices, Unnamed Item, On friendly index sets of 2-regular graphs, \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs, 3-total edge product cordial labeling of rhombic grid, A Partial Solution to Cordial Tree Conjecture, All trees are six-cordial, On total edge product cordial labeling of fullerenes, Group irregularity strength of connected graphs, On some graph-cordial abelian groups
Cites Work
