Bounds for scattering number and rupture degree of graphs with genus
From MaRDI portal
Publication:2335659
DOI10.1016/j.amc.2018.05.023zbMath1427.05120OpenAlexW2808010438WikidataQ129726047 ScholiaQ129726047MaRDI QIDQ2335659
Publication date: 15 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.05.023
Cites Work
- Extremal graphs with given order and the rupture degree
- Scattering number and extremal non-Hamiltonian graphs
- A catalogue of small maximal nonhamiltonian graphs
- Connectivity, genus, and the number of components in vertex-deleted subgraphs
- On a class of posets and the corresponding comparability graphs
- Maximum and minimum toughness of graphs of small genus
- Analyzing lattice networks through substructures
- Vertex-based and edge-based centroids of graphs
- Das Geschlecht des vollständigen paaren Graphen
- On the genus and connectivity of Hamiltonian graphs
- Tough graphs and Hamiltonian circuits.
- Scattering number in graphs
- Rupture degree of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounds for scattering number and rupture degree of graphs with genus