On graphs that are critical with respect to the parameters: diameter, connectivity and edge-connectivity
Abstract
In graph theory, the term critical is usually used with respect to specified graph parameter P and applies when the graph G under consideration has the property P but alteration of G (such as vertex deletion, edge deletion or edge addition) result in a graph not having property P. In this paper, we consider graphs which are critical with respect to parameter P under the single operation of: deleting a vertex; deleting an edge; adding an edge. In particular, we focus on the graph parameters: diameter, connectivity and edge-connectivity. We review important results and mention many open problems.
Downloads
Published
Issue
Section
License
The authors retain all rights to the original work without any restrictions.
License for Published Contents
"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
License for Metadata
"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
No Fee Charging
No fee is required to complete the submission/review/publishing process of authors paper.
