نتایج جستجو برای: graph products
تعداد نتایج: 485228 فیلتر نتایج به سال:
The problem of recognizing approximate graph products arises in theoretical biology. This paper presents an algorithm that recognizes a large class of approximate graph products. The main part of this contribution is concerned with a new, local prime factorization algorithm that factorizes all strong products on an extensive class of graphs that contains, in particular, all products of triangle...
The antipodal graph of a graph G, denoted by A(G), is the graph on the same vertices as ofG, two vertices being adjacent if the distance between them is equal to the diameter of G. A graph is said to be antipodal if it is the antipodal graph A(H) of some graph H . In this paper, we consider four kinds of graph products and introduce the antipodal graph of each product with respect to the antipo...
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید