Results 251 to 260 of about 2,669,595 (286)
Some of the next articles are maybe not open access.
Factoring cartesian‐product graphs
Journal of Graph Theory, 1994AbstractIn a fundamental paper, G. Sabidussi [“Graph Multiplication,” Mathematische Zeitschrift, Vol. 72 (1960), pp. 446–457] used a tower of equivalence relations on the edge set E(G) of a connected graph G to decompose G into a Cartesian product of prime graphs. Later, a method by R.L. Graham and P.M.
Imrich, Wilfried, Žerovnik, Janez
openaire +2 more sources
On the Width of the Cartesian Product of Ordinals
OrderzbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Cartesian products of trees and paths
Journal of Graph Theory, 1996Let all graphs be connected and simple, not necessarily finite. A subgraph \(F\) of \(G\) is called isometric if any two vertices of \(F\) have the same distance in \(G\) as in \(F\); and the interval \(I(x,y)\) consists of all vertices on the shortest paths between \(x\) and \(y\).
Hans-Jürgen Bandelt +2 more
openaire +3 more sources
On the skewness of Cartesian products with trees
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhangdong Ouyang +2 more
openaire +1 more source
The determining number of a Cartesian product
Journal of Graph Theory, 2009AbstractA set S of vertices is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of G, denoted Det(G), is the size of a smallest determining set. This paper begins by proving that if G=G□⋅□G is the prime factor decomposition of a connected graph then Det(G)=max{Det(G)}.
openaire +3 more sources
Controllability of Cartesian Product Signed Networks
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2023Junjie Huang, Housheng Su
exaly
On the security number of the Cartesian product of graphs
Discrete Applied Mathematics, 2021Yota Otachi, Marko Jakovac
exaly