The generalized k-connectivity κk(G) of a graph G is a generalization of the concept of the traditional connectivity, which can serve for measuring the capability of a graph G to connect any k vertices in G. In a search for triangle-free graphs with arbitrarily large chromatic numbers, My...
53:39 Deep Learning with Differential Privacy-Li Zhang 59:39 国际基础科学大会-Swarm of Micro Flying Robots in the Wild-Xin Zhou 54:00 国际基础科学大会-Lensless Imaging: Overview, Opportunities, and Challenges 59:57 国际基础科学大会-Heterogeneous Graph Neural Network-Chuxu Zhang 49:44 ...
The generalized k-connectivity K-k (G) of a graph G is a generalization of the concept of the traditional connectivity, which can serve for measuring the capability of a graph G to connect any K vertices in G. In a search for triangle-free graphs with arbitrarily large chromatic numbers,...
The connectivity of a graph is an important topology parameter in graph theory. The connectivity can be used to assess the vulnerability of the corresponding network, and is an important measurement for the reliability and fault tolerance of the network [5]. Given a connected graph G=(V,E),...
SS Neelannavar,A Girisha - 《Journal of Physics Conference》 被引量: 0发表: 2021年 The g-Good-Neighbor Connectivity of Some Cartesian Product Graphs The g-good-neighbor connectivity of G is a generalization of the concept of connectivity, which is just for, and an important parameter in meas...
rule-based approach [2,6,21,30] and the graph- based approach [3,4,15,17,24,25,27]. This paper will focus on using graph algorithms to decompose a large constraint problem into smaller ones. In [29], Owen proposed a GCS method based on the tri-connected decomposition of graphs, ...
The generalized k-connectivity kappa(k)(G) of a graph G, which was introduced by Chartrand et al. (1984) is a generalization of the concept of vertex conne... BWK Gao - 《Applied Mathematics & Computation》 被引量: 0发表: 2018年 Two bounds for generalized $3$-connectivity of Cartesian...
This generalizationis a natural extension of the classical connectivity def i ned in term of minimum vertex-cut. As an application, the ‘-connectivity can be used to assess the vulnerability of agraph corresponding to the underlying topology of an interconnection network, and thus isan important ...
-connected for some particular a . let 〈 a 〉 denote the family of graphs which are a -connected. integer flow problems were introduced by tutte [11] , [13] . group connectivity was introduced by jaeger et al. [7] as a generalization of nowhere-zero flows. this paper is mainly ...
The concept of group connectivity was introduced by Jaeger, Linial, Payan, and Tarsi (Journal Combinatorial Theory, Ser. B, 1992) as a generalization of nowhere-zero group flows. Let A be an Abelian group. An A-connected graphs are contractible configurations of A-flow and play an important...