Diclique digraphs
From MaRDI portal
Recommendations
Cites work
- (Quantum) spacetime as a statistical geometry of lumps in random networks
- A characterization of clique graphs
- A geometric renormalization group in discrete quantum space–time
- A partial characterization of clique graphs
- Almost every graph is divergent under the biclique operator
- An infinite family of self-diclique digraphs
- Biclique graphs and biclique matrices
- Clique divergent clockwork graphs and partial orders
- Extensions of graph inversion to support an artificially intelligent modeling environment
- Graph relations, clique divergence and surface triangulations
- scientific article; zbMATH DE number 4049680 (Why is no real title available?)
- scientific article; zbMATH DE number 3641500 (Why is no real title available?)
- scientific article; zbMATH DE number 1944140 (Why is no real title available?)
- scientific article; zbMATH DE number 1842907 (Why is no real title available?)
- scientific article; zbMATH DE number 851097 (Why is no real title available?)
- On expansive graphs
- On the iterated biclique operator
- On the termination of some biclique operators on multipartite graphs
- Self-diclique circulant digraphs.
- Space-time as an order-parameter manifold in random networks and the emergence of physical points
- Termination of the iterated strong-factor operator on multipartite graphs
- The Diclique Representation and Decomposition of Binary Relations
- The number of convergent graphs under the biclique operator with no twin vertices is finite
- The structurally dynamic cellular network and quantum graphity approaches to quantum gravity and quantum geometry -- a review and comparison
- Tight lower bounds on the number of bicliques in false-twin-free graphs
This page was built for publication: Diclique digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180580)