Study of the Bipartite Edge Frustration of Graphs

DOI10.1007/978-3-319-31584-3_15zbMath1360.05037OpenAlexW2515914226MaRDI QIDQ2980024

Zahra Yarahmadi

Publication date: 27 April 2017

Published in: Distance, Symmetry, and Topology in Carbon Nanomaterials (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31584-3_15

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

On the normalized Laplacian spectral radii of a graph and its line graph

Cites Work

• The bipartite edge frustration of composite graphs
• The bipartite edge frustration of graphs under subdivided edges and their related sums
• Extremal properties of the bipartite vertex frustration of graphs
• The bipartite edge frustration of extension of splice and link graphs
• The hierarchical product of graphs
• Maximum bipartite subgraphs of cubic triangle-free planar graphs
• The vertex PI index and Szeged index of bridge graphs
• Four new sums of graphs and their Wiener indices
• The generalized hierarchical product of graphs
• 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
• 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: Study of the Bipartite Edge Frustration of Graphs