The bipartite edge frustration of extension of splice and link graphs

DOI10.1016/j.aml.2010.04.039zbMath1210.05115MaRDI QIDQ988725

Zahra Yarahmadi

Publication date: 18 August 2010

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

Full work available at URL: https://doi.org/10.1016/j.aml.2010.04.039

zbMATH Keywords

bipartite graph; link; bipartite edge frustration; splice; polybuckyball

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

The bipartite edge frustration of hierarchical product of graphs, A characterization of the edge connectivity of direct products of graphs, On the bipartite vertex 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 chromatic edge stability number of graphs, Nordhaus-Gaddum and other bounds for the chromatic edge-stability number, The relationship between the eccentric connectivity index and Zagreb indices, Study of the Bipartite Edge Frustration of Graphs

Cites Work

• The bipartite edge frustration of composite graphs
• Computing the bipartite edge frustration of fullerene graphs
• On some extremal problems in graph theory
• Maximumk-colorable subgraphs
• Extremal bipartite subgraphs of cubic triangle-free graphs
• Some Extremal Properties of Bipartite Subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item