Incidence graphs of bipartite G-graphs
From MaRDI portal
Recommendations
Cites work
- G-graphs for the cage problem: a new upper bound
- \(G\)-graphs: a new representation of groups
- A New Property of Hamming Graphs and Mesh of d-ary Trees
- scientific article; zbMATH DE number 2185572 (Why is no real title available?)
- scientific article; zbMATH DE number 5844242 (Why is no real title available?)
- scientific article; zbMATH DE number 3758564 (Why is no real title available?)
- Symmetric and semisymmetric graphs construction using G-graphs
Cited in
(6)- Incidence graphs of biacyclic hypergraphs
- About some robustness and complexity properties of G-graphs networks
- A New Property of Hamming Graphs and Mesh of d-ary Trees
- Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices
- scientific article; zbMATH DE number 2152547 (Why is no real title available?)
- scientific article; zbMATH DE number 5054167 (Why is no real title available?)
This page was built for publication: Incidence graphs of bipartite \(G\)-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596158)