The bipartite edge frustration of composite graphs

DOI10.1016/j.dam.2010.04.010zbMath1215.05094OpenAlexW2016127501WikidataQ61987862 ScholiaQ61987862MaRDI QIDQ608263

Tomislav Došlić, Ali Reza Ashrafi, Zahra Yarahmadi

Publication date: 25 November 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.04.010

zbMATH Keywords

bipartite graphcomposite graphbipartite edge frustration

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

The bipartite edge frustration of hierarchical product of graphs ⋮ Graphs with maximum Laplacian and signless Laplacian Estrada index ⋮ On the critical difference of almost bipartite graphs ⋮ A characterization of the edge connectivity of direct products of graphs ⋮ Study of the Bipartite Edge Frustration of Graphs ⋮ The bipartite edge frustration of graphs under subdivided edges and their related sums ⋮ Extremal properties of the bipartite vertex frustration of graphs ⋮ On the bipartite vertex frustration of graphs ⋮ The bipartite edge frustration of extension of splice and link graphs ⋮ The sigma coindex of graph operations

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum bipartite subgraphs of cubic triangle-free planar graphs
• The vertex PI index and Szeged index of bridge graphs
• Computing the bipartite edge frustration of fullerene graphs
• On some extremal problems in graph theory
• On Complementary Graphs
• Largest bipartite subgraphs in triangle-free graphs with maximum degree three
• Extremal bipartite subgraphs of cubic triangle-free graphs
• Some Extremal Properties of Bipartite Subgraphs

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