E_A-cordial labeling of graphs and its implications for A-antimagic labeling of trees
From MaRDI portal
\(E A\)-cordial labeling of graphs and its implications for \(A\)-antimagic labeling of trees
Cites work
- \(R\)-sequenceability and \(R^*\)-sequenceability of Abelian 2-groups
- A-cordial graphs
- Generalized graph cordiality
- Graph theory
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- 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?)
- scientific article; zbMATH DE number 1409217 (Why is no real title available?)
- scientific article; zbMATH DE number 6540108 (Why is no real title available?)
- Klein cordial trees and odd cyclic cordial friendship graphs
- On some graph-cordial abelian groups
- On the \(E_k\)-cordiality of some graphs.
- On zero-sum partitions and anti-magic trees
- Path-cordial abelian groups
- Sums and differences along Hamiltonian cycles
- Zero-sum partitions of abelian groups and their applications to magic- and antimagic-type labelings
This page was built for publication: \(E_A\)-cordial labeling of graphs and its implications for \(A\)-antimagic labeling of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6973988)