Neighbor Connectivity of the Alternating Group Graph
Given a graph G=(V,E), its neighbor connectivity is the least number of vertices whose deletion along with their neighbors results in a disconnected, complete, or empty graph. The edge neighbor connectivity is the least number of edges whose deletion along with their endpoints results in a disconnec...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| منشور في: |
2021
|
| الوصول للمادة أونلاين: | https://dspace.auk.edu.kw/handle/11675/8179 https://doi.org/10.1142/S0219265921500146 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|