期刊： ARS COMBINATORIA, 2021; 154 ()
In this paper, we present sufficient conditions based on some topological indices involving eccentricities for a graph to be beta-deficient, k-hamilto......
期刊： ARS COMBINATORIA, 2021; 154 ()
A graph G is said to he n-extendable if it has a matching of size n, and every matching of size n extends to a perfect matching of G. Let G = (X, Y) h......
期刊： ARS COMBINATORIA, 2021; 154 ()
Let e = uv be an edge of G, m(1)(e) be the number of edges of G lying closer to vertex u than vertex v and m(2)(e) the number of edges of G lying clos......
期刊： ARS COMBINATORIA, 2021; 154 ()
For a (molecular) graph, Zagreb indices (M-1 and M-2) are two well-known topological indices. Recently M-2 - M-1 was studied, and a new vertexdegree-b......
期刊： ARS COMBINATORIA, 2021; 154 ()
The anti-Kekule number of a connected graph G is the smallest number of edges whose removal will result in a connected subgraph without Kekule structu......
期刊： ARS COMBINATORIA, 2021; 154 ()
The L(3, 2, 1) -labeling number of a graph G is the smallest number k such that G has a k-L(3, 2, 1) -labeling. In 2015, Kim et al.[L(3,2,1)-labeling ......
期刊： ARS COMBINATORIA, 2021; 154 ()
Let S(m) denote a circle of circumference m. The circular distance of two numbers (or two points on S(m)) a and b with 0 <= a, b < m on S(m), de......
期刊： ARS COMBINATORIA, 2021; 154 ()
For a graph G and a set F of connected graphs, G is said be F-free if G does not contain any member of F as an induced subgraph. We let G(3)(F) denote......
期刊： ARS COMBINATORIA, 2020; 149 ()
Let a and b be two positive integers with 1 <= a <= b, and let G be a graph of order n >= (a+b)(2a+b)/a. We say that G admits all fractional ......
期刊： ARS COMBINATORIA, 2020; 149 ()
For simple graphs G, G(1) and G(2), we denote their double corona based on R-graph by G((R)) circle times{G(1), G(2)}. This paper determines the norma......
期刊： ARS COMBINATORIA, 2020; 149 ()
Let G be an n-vertex strongly connected digraph. In this paper, the relationships between almost spanning strongly connected bipartite subgraphs and t......
期刊： ARS COMBINATORIA, 2020; 149 ()
The asymptotic value between the size of a lifted maximum rank distance codes and the size of Singleton bound and asymptotic value between the size of......
期刊： ARS COMBINATORIA, 2020; 149 ()
Let S-n be the symmetric group of degree n with n >= 3. Set S = {(1 i), (j j+1) : 2 <= i <= n, 2 <= 5 j <= n - 1}. The bubble-sort star......
期刊： ARS COMBINATORIA, 2020; 149 ()
In this paper, we study some bounds of constant dimension codes further in Grassmannian space G(q)(n, k). There is an increasing interest in subspace ......
期刊： ARS COMBINATORIA, 2020; 149 ()
Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of removing two pebbles from one vertex and plac......
