期刊： UTILITAS MATHEMATICA, 2020; 114 ()
G = (V(G),E(G)) be a simple undirected graph of order n and size m, and x, y, z be three variables taking value + or -. The transformation graph CzY- ......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
A linear k-forest refers to a forest in which every component is a path of length at most k. The linear k-arboricity of a graph G is defined as the le......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
An edge labeling of a graph G is a bijection f : E(G) {1, 2, " " ", 1E(G)1}. The induced vertex sum f+ of f is a function defined on V(G) given by f+ ......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
Strongly chordal graphs are characterized here as being the chordal graphs in which the uncrossed chords of a cycle always form a forest (an "independ......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
It is shown that, up to isomorphism, there are 35 810 097 maximum partial triple systems on 17 points and 47 744 568 maximal partial triple systems on......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
A set of vertices B subset of V(G) is called a k-limited packing set in G if vertical bar N[v] boolean AND B vertical bar <= k for all v is an elem......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
A majority total dominating function of a graph G = (V, E) is a function g : V * {1,1} such that g (N (v)) > 1 for at least half of the vertices v ......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
In this paper we present and expand upon procedures for obtaining a large k-digit prime number to an arbitrarily high probability. We use a layered ap......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
Two-periodic unit cube tilings of the 4-dimensional Euclidean space are classified. This paper contains the algorithm one used to do the classificatio......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
A graph G is fractional ID-[a, b]-factor-critical covered if for any independent set I of G, G I is fractional [a, b]-covered. In this article, we pre......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
Opposite edges in a connecting graph which lies in the same face eventually form a strip of adjacent faces and plays a major rule in the construction ......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
A parallel class in a design is a set of blocks that partition the point set. The intersection problem for Steiner systems with a common parallel clas......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
It is a large and demanding project for determining pairs (D, G) in which D is a 2 - (v, k, 1) design and G is a block-transitive group of automorphis......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
The decycling number of a graph G is the minimum number of vertices whose removal from G results in an acyclic subgraph. The d-ary n-dimensional cubes......
期刊： UTILITAS MATHEMATICA, 2020; 114 ()
Let m, n, k be three positive integers. A path factor with each component having at least n vertices is called a P >= n-factor. A graph G is define......
