The bipartite edge frustration of extension of splice and link graphs
From MaRDI portal
Publication:988725
DOI10.1016/j.aml.2010.04.039zbMath1210.05115OpenAlexW1966998205MaRDI QIDQ988725
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
Related Items (9)
The bipartite edge frustration of hierarchical product of graphs ⋮ A characterization of the edge connectivity of direct products of graphs ⋮ Study of the Bipartite Edge Frustration of Graphs ⋮ The relationship between the eccentric connectivity index and Zagreb indices ⋮ The bipartite edge frustration of graphs under subdivided edges and their related sums ⋮ Extremal properties of the bipartite vertex frustration of graphs ⋮ On 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
This page was built for publication: The bipartite edge frustration of extension of splice and link graphs