Cordiality of digraphs

DOI10.13069/JACODESMATH.V10I1.195MaRDI QIDQ7012959zbMATH OpenFDO

Authors Leroy B. Beasley, M. Santana, Jonathan Mousley, David E. Brown

Publication date 14 March 2025

Published in Journal of Algebra, Combinatorics, Discrete Structures and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.13069/JACODESMATH.V10I1.195

zbMATH Keywords

\((2,3)\)-cordialityfan graphtournamentwheel graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• A-cordial graphs
• Generalized graph cordiality
• scientific article; zbMATH DE number 3997850 (Why is no real title available?)
• PC-labeling of a graph and its PC-set

Cited in

(1)

• Binary graph labelings and linear preservers

This page was built for publication: Cordiality of digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7012959)