On interval graphs and matrice profiles
On Irreducible Graphs of Diameter Two without Triangles
On isomorphisms of graphs of lattices
On isopart parameters of complete bipartite graphs and -cubes
On iteration digraph and zero-divisor graph of the ring
In the first part, we assign to each positive integer a digraph whose set of vertices consists of elements of the ring with the addition and the multiplication operations modulo and for which there is a directed edge from to if and only if . Associated with are two disjoint subdigraphs: and whose union is The vertices of are coprime to and the vertices of are not coprime to In this part, we study the structure of in detail. In the second part, we investigate the zero-divisor...
On -Pancyclic Graphs
On -colored Motzkin words.
On -domatic numbers of graphs
On -radius of random graphs.
On -ordered bipartite graphs.
On -pairable graphs from trees
The concept of the -pairable graphs was introduced by Zhibo Chen (On -pairable graphs, Discrete Mathematics 287 (2004), 11–15) as an extension of hypercubes and graphs with an antipodal isomorphism. In the same paper, Chen also introduced a new graph parameter , called the pair length of a graph , as the maximum such that is -pairable and if is not -pairable for any positive integer . In this paper, we answer the two open questions raised by Chen in the case that the graphs involved...
On -path hamiltonian graphs and line-graphs
On -ply domatic numbers of graphs
On -strong distance in strong digraphs
For a nonempty set of vertices in a strong digraph , the strong distance is the minimum size of a strong subdigraph of containing the vertices of . If contains vertices, then is referred to as the -strong distance of . For an integer and a vertex of a strong digraph , the -strong eccentricity of is the maximum -strong distance among all sets of vertices in containing . The minimum -strong eccentricity among the vertices of is its -strong radius and the maximum...
On -Thin Sets and -Extensive Graphs
On -walk-regular graphs.
On Kadell's two conjectures for the -Dyson product.
On kaleidoscopic pseudo-randomness of finite Euclidean graphs
D. Hart, A. Iosevich, D. Koh, S. Senger and I. Uriarte-Tuero (2008) showed that the distance graphs has kaleidoscopic pseudo-random property, i.e. sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configurations. In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods.
On k-closure operators in graphs
On k-closure operators in graphs. II