The bipartite edge frustration of graphs under subdivided edges and their related sums

DOI10.1016/j.camwa.2011.05.012zbMath1228.05132WikidataQ61987755 ScholiaQ61987755MaRDI QIDQ651481

Zahra Yarahmadi, Ali Reza Ashrafi

Publication date: 18 December 2011

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.05.012

zbMATH Keywords

bipartite graph; bipartite edge frustration; subdivided graph; fullerene graph

Mathematics Subject Classification ID

05C90: Applications of graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

Related Items

On the bipartite vertex frustration of graphs, Nordhaus-Gaddum and other bounds for the chromatic edge-stability number, Critical graphs for the chromatic edge-stability number, Study of the Bipartite Edge Frustration of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The bipartite edge frustration of composite graphs
• The bipartite edge frustration of extension of splice and link graphs
• Maximum bipartite subgraphs of cubic triangle-free planar graphs
• Four new sums of graphs and their Wiener indices
• Computing the bipartite edge frustration of fullerene graphs
• The behavior of Wiener indices and polynomials of graphs under five graph decorations
• On some extremal problems in graph theory
• 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