Generalized graph cordiality
From MaRDI portal
Publication:4648787
DOI10.7151/DMGT.1626zbMATH Open1257.05152OpenAlexW2111446554MaRDI QIDQ4648787FDOQ4648787
Authors: Oliver Pechenik, Jennifer I. Wise
Publication date: 16 November 2012
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1626
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Loops, quasigroups (20N05)
Cited In (16)
- Uniformly cordial graphs
- All trees are six-cordial
- Pair difference cordiality of certain subdivision graphs
- The cordiality game and the game cordiality number
- A-cordial graphs
- Title not available (Why is that?)
- (2, 3)-cordial trees and paths
- (2, 3)-cordial oriented hypercubes
- On some graph-cordial abelian groups
- \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs
- Path-cordial abelian groups
- Some new results on \(k\)-cordial labeling.
- Klein cordial trees and odd cyclic cordial friendship graphs
- 4-cordiality of some regular graphs and the complete 4-partite graph
- Generalization of some results on cordial graphs.
- Title not available (Why is that?)
This page was built for publication: Generalized graph cordiality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648787)