An infinite family of self-diclique digraphs
From MaRDI portal
Publication:968563
DOI10.1016/J.AML.2010.01.026zbMATH Open1214.05041OpenAlexW2089886848MaRDI QIDQ968563FDOQ968563
Authors: A. P. Figueroa, Bernardo Llano
Publication date: 5 May 2010
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2010.01.026
Recommendations
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Cited In (8)
- Self-diclique circulant digraphs.
- Diclique digraphs
- On self-clique graphs with triangular cliques
- On bicliques and the second clique graph of suspensions
- Disimplicial arcs, transitive vertices, and disimplicial eliminations
- On cliques and bicliques
- On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices
- CNF and DNF succinct graph encodings
This page was built for publication: An infinite family of self-diclique digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968563)