The bipartite edge frustration of hierarchical product of graphs
From MaRDI portal
Publication:277458
DOI10.1016/j.endm.2013.11.021zbMath1338.05230OpenAlexW2068385035WikidataQ61987599 ScholiaQ61987599MaRDI QIDQ277458
Ali Reza Ashrafi, Zahra Yarahmadi
Publication date: 29 April 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2013.11.021
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- The bipartite edge frustration of composite graphs
- The bipartite edge frustration of extension of splice and link graphs
- The hierarchical product of graphs
- The generalized hierarchical product of graphs
- Computing the bipartite edge frustration of fullerene graphs
- On some extremal problems in graph theory
This page was built for publication: The bipartite edge frustration of hierarchical product of graphs