The bipartite edge frustration of composite graphs

DOI10.1016/J.DAM.2010.04.010MaRDI QIDQ608263zbMATH OpenOpenAlexWikidataFDO

Authors Tomislav Došlić, A. R. Ashrafi, Z. 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 graphbipartite edge frustrationcomposite graph

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Computing the bipartite edge frustration of fullerene graphs
• Extremal bipartite subgraphs of cubic triangle-free graphs
• Largest bipartite subgraphs in triangle-free graphs with maximum degree three
• Maximum bipartite subgraphs of cubic triangle-free planar graphs
• On Complementary Graphs
• On some extremal problems in graph theory
• Some Extremal Properties of Bipartite Subgraphs
• The vertex PI index and Szeged index of bridge graphs

Cited in

(12)

• Study of the bipartite edge frustration of graphs
• New formulae for the bipartite vertex frustration and decycling number of graphs
• The bipartite edge frustration of hierarchical product of graphs
• The bipartite edge frustration of extension of splice and link graphs
• The sigma coindex of graph operations
• On the critical difference of almost bipartite graphs
• Computing the bipartite edge frustration of fullerene 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)