Extremal properties of the bipartite vertex frustration of graphs

DOI10.1016/j.aml.2011.04.022zbMath1234.05134WikidataQ61987699 ScholiaQ61987699MaRDI QIDQ654182

Zahra Yarahmadi, Ali Reza Ashrafi

Publication date: 28 December 2011

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

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

zbMATH Keywords

bipartite graph; extremal graph; bipartite vertex frustration

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

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

Related Items

The inverse sum indeg index of graphs with some given parameters, On the bipartite vertex frustration of graphs, New formulae for the bipartite vertex frustration and decycling number of graphs, Graphs with maximum Laplacian and signless Laplacian Estrada index, Study of the Bipartite Edge Frustration of Graphs

Cites Work

• 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
• Parallel concepts in graph theory
• Computing the bipartite edge frustration of fullerene graphs
• On some extremal problems in graph theory
• Faster fixed parameter tractable algorithms for finding feedback vertex sets
• Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
• 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