Edge Neighbor Toughness of Graphs
A new graph parameter, edge neighbor toughness is introduced to measure how difficult it is for a graph to be broken into many components through the deletion of the closed neighborhoods of a few edges. Let <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics>...
Furkejuvvon:
| Váldodahkkit: | , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
MDPI AG
2022-05-01
|
| Ráidu: | Axioms |
| Fáttát: | |
| Liŋkkat: | https://www.mdpi.com/2075-1680/11/6/248 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|