نتایج جستجو برای: cartesian product of graphs
تعداد نتایج: 21193274 فیلتر نتایج به سال:
Journal:
:TURKISH JOURNAL OF MATHEMATICS
2018
Journal:
:Theoretical Computer Science
2009
Journal:
:Ars Mathematica Contemporanea
2013
Journal:
:Discrete Applied Mathematics
2015
Journal:
:Journal of Combinatorial Optimization
2004
Journal:
:Graphs and Combinatorics
2008
Journal:
:Discrete Applied Mathematics
2002
Journal:
:Discrete Mathematics
2012
Marc Hellmuth
Lydia Ostermeier
Peter F. Stadler
A graph is said to be S-prime if, whenever it is a subgraph of a nontrivial Cartesian product graph, it is a subgraph of one of the factors. A diagonalized Cartesian product is obtained from a Cartesian product graph by connecting two vertices of maximal distance by an additional edge. We show there that a diagonalized product of S-prime graphs is again S-prime. Klavžar et al. [Discr. Math. 244...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید