TL;DR
This paper investigates mixed cages, which are regular graphs with both directed and undirected edges, focusing on establishing upper bounds through construction methods and computer searches.
Contribution
It introduces new upper bounds for mixed cages using general constructions and computational searches, advancing understanding of their properties.
Findings
Derived new upper bounds for mixed cages.
Developed general construction methods for mixed cages.
Performed computer searches to identify minimal mixed cages.
Abstract
Mixed graphs have both directed and undirected edges. A mixed cage is a regular mixed graph of given girth with minimum possible order. In this paper mixed cages are studied. Upper bounds are obtained by general construction methods and computer searches.
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
TopicsAdvanced Graph Theory Research · Interconnection Networks and Systems · Graph Labeling and Dimension Problems