Lick, Generalized connectivity in graphs, Bull. Bombay Math. Colloq. 2(1984), 1-6.X. Li, Y. Mao, Generalized Connectivity of Graphs, Springer Briefs in math., Springer, New York, 2016.X. Li, Y. Mao. Generalized Connectivity of Graphs. SpringerBriefs in Math., Springer, Switzerland, ...
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...
We discuss the regularity of thegeneralized joinof two graphs. 讨论了两个图的广义联图的End -正则性 ,给出了当图X、Y的广义联图G(y1,…ym)End -正则时 ,图X也End -正则应满足的条件 。 2) generalized join 广义联图 1. Some results on inversity of endomorphism monoid ofgeneralized join; ...
GENERALIZED CONNECTIVITY OF (n, k)-STAR GRAPHS In fact, the conclusions of generalized edge-connectivity in the known graphs are few, so this work is very valuable. Y Wei,M Liu - International Conference on Information Science 被引量: 8发表: 2013年 On restricted edge-connectivity of lexicogra...
Results on the generalized connectivity can be seen in[6], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21]. Let G(n) denote the class of simple graphs of order n(n≥2) and G(n,m) the subclass of G(n) in which every graph has n vertices and m ...
Generalized sum connectivity invariant of graphs In this paper, we study the generalized distance matrix D-alpha(G) assigned to simple connected graph G, which is the convex combinations of Tr(G) and D(G)... P Seenuvasan - American Institute of Physics Conference Series 被引量: 0发表: 20...
Super edge connectivityAll graphs considered in this paper are simple, finite, nontrivial and undirected.Let G be a graph with vertex set \\\(V^0=\\\{v_0^0,v_1^0,\\\ldots,v_{n-1}^0\\\}\\\) and edge set E 0 . Given an integer m ≥ 1, the m -Mycielskian (...
Incidence chromatic number of several generalized Petersen graphs; 若干广义Petersen图的关联色数2. G(2m+1,m)is a class of generalized Petersen graph. 对于广义Petersen图G(2m+1,m),当m≡1,4(mod 6),给出了最大亏格的表达式,对其余情形,给出了不可定向强最大亏格的上界和下界。3...
connected planar graph, thenκ(G)−1≤κ3(G)≤κ(G), and give some classes of graphs which attain the bounds. In the end we give an algorithm to determineκ3(G)for general graphsG. This algorithm runs in a polynomial time for graphs with a fixed value of connectivity, which ...
Sandwiching the (generalized) Randić indexRandić indexConnectivity indexBranching indexIndex R′Index R″The well-known Randić index of a graph G is defined as R(G)=∑(du⋅dv)−1/2, where the sum is taken over all edges uv∈E(G) and du and dv denote the degrees of u and...