On the Cordial Deficiency of Complete Multipartite Graphs
Adrian Riskin
TL;DR
This paper investigates the cordial deficiencies of complete multipartite graphs, providing calculations, bounds, and conditions for the cordiality of tensor products of such graphs.
Contribution
It introduces new bounds for cordial deficiencies and establishes conditions for the cordiality of tensor products of graphs.
Findings
Calculated cordial edge deficiencies for complete multipartite graphs.
Provided an upper bound for their cordial vertex deficiencies.
Identified conditions under which tensor products of cordial graphs are cordial.
Abstract
We calculate the cordial edge deficiencies of the complete multipartite graphs and find an upper bound for their cordial vertex deficiencies. We also give conditions under which the tensor product of two cordial graphs is cordial.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Graph theory and applications