Scholarlink

The two connectivity parametersParameter in graphGraph theory are vertexVertexConnectivity connectivity and edgeEdge connectivity of a given graphGraph. The question here is to find the rigidness of a graphGraph remains connectedConnected by removing a single vertexVertex/edgeEdge, then we look for minimumMinimum numberNumbers of verticesVertex/edgesEdge to be removed resulting in a disconnected graphGraph or trivial graphGraph. The parametersParameter are \(\kappa \) (kappa) and \(\lambda \) (lambda).

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Connectivity

  • 章节

  • 发表日期：

    2025年

查看全文
  • R. Rama

摘要

The two connectivity parametersParameter in graphGraph theory are vertexVertexConnectivity connectivity and edgeEdge connectivity of a given graphGraph. The question here is to find the rigidness of a graphGraph remains connectedConnected by removing a single vertexVertex/edgeEdge, then we look for minimumMinimum numberNumbers of verticesVertex/edgesEdge to be removed resulting in a disconnected graphGraph or trivial graphGraph. The parametersParameter are \(\kappa \) (kappa) and \(\lambda \) (lambda).