Acyclic kernel number of oriented cycle related graphs
From MaRDI portal
Publication:3166160
zbMATH Open1248.05094MaRDI QIDQ3166160FDOQ3166160
Authors: S. Little Joice, Indra Rajasingh, Bharati Rajan
Publication date: 21 October 2012
Recommendations
Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38) Games on graphs (graph-theoretic aspects) (05C57)
Cited In (7)
- Counting kernels in directed graphs with arbitrary orientations
- Kernel in Oriented Circulant Graphs
- A note on the kernel number
- On the complexity of the 3-kernel problem in some classes of digraphs
- Acyclic kernel number of biregular graphs
- Strong kernel in certain oriented networks
- Strong kernel number in certain oriented cycle extension of graphs
This page was built for publication: Acyclic kernel number of oriented cycle related graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166160)