The bipartite edge frustration of composite graphs

DOI10.1016/J.DAM.2010.04.010zbMATH Open1215.05094OpenAlexW2016127501WikidataQ61987862 ScholiaQ61987862MaRDI QIDQ608263FDOQ608263

Tomislav Došlić, Z. Yarahmadi, A. R. Ashrafi

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

Recommendations

• Study of the bipartite edge frustration of graphs
• The bipartite edge frustration of extension of splice and link graphs
• The bipartite edge frustration of hierarchical product of graphs
• On the bipartite vertex frustration of graphs
• The bipartite edge frustration of graphs under subdivided edges and their related sums

zbMATH Keywords

bipartite graphbipartite edge frustrationcomposite graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Some Extremal Properties of Bipartite Subgraphs
• Computing the bipartite edge frustration of fullerene graphs
• On some extremal problems in graph theory
• The vertex PI index and Szeged index of bridge graphs
• On Complementary Graphs
• Maximum bipartite subgraphs of cubic triangle-free planar graphs
• Largest bipartite subgraphs in triangle-free graphs with maximum degree three
• Extremal bipartite subgraphs of cubic triangle-free graphs

Cited In (10)

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

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

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