The bipartite edge frustration of hierarchical product of graphs

DOI10.1016/J.ENDM.2013.11.021zbMATH Open1338.05230OpenAlexW2068385035WikidataQ61987599 ScholiaQ61987599MaRDI QIDQ277458FDOQ277458

A. R. Ashrafi, Z. Yarahmadi

Publication date: 29 April 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2013.11.021

zbMATH Keywords

\((3,6)\)-fullerene graphbipartite edge frustrationhierarchical product

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• The bipartite edge frustration of composite graphs
• The bipartite edge frustration of extension of splice and link graphs

Cited In (1)

• On the bipartite vertex frustration of graphs

This page was built for publication: The bipartite edge frustration of hierarchical product of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q277458)