Every branch of mathematics employs some notion of a product that enables the com-
bination or decomposition of its elemental structures. In graph theory there are four main …

When dealing with special graph classes and algorithmic problems on them, a main source
is the classical book of Golumbic, Algorithmic Graph Theory and Perfect Graphs [454]. The …

We present an algorithm that determines the prime factors of connected graphs with respect
to the Cartesian product in linear time and space. This improves a result of Aurenhammer et …

2 monumental yet enjoyable work on distance-transitivity and related subjects with detailed
up-to-date information. Much of our current knowledge on graph isomorphism testing is …

In this paper a polynomial algorithm for the prime factorization of finite, connected
nonbipartite graphs with respect to the cardinal product is presented. This algorithm also …

Let M (m, n) be the complexity of checking whether a graph G with m edges and n vertices is
a median graph. We show that the complexity of checking whether G is triangle-free is at …

SOME NEW RESULTS ON IRREGULARITY OF GRAPHS -Journal of applied mathematics &
informatics | Korea Science society@kisti.re.kr Login English 한국어 English KoreaScience …

Let R be a commutative ring, the Pseudo–Von Neumann regular graph of the ring R is
define as a graph whose vertex set consists of all elements of R and any two distinct vertices …

This paper is a contribution to the recognition of classes of graphs defined by metric
properties. These classes include Hamming graphs, quasi-median graphs, partial Hamming …

Graph bundles generalize the notion of covering graphs and graph products. In this paper
we extend some of the methods for recognizing Cartesian product graphs to graph bundles …