类 型
3 篇文献
 
Interleaved adjoints on directed graphs  
For an integer k >= 1, the k-th interlacing adjoint of a digraph G is the digraph i_k(G) with vertex-set V(G)^k, and arcs ((u_1, ..., u_k), (v_1, ..., v_k)) such that (u_i,v_i) \in A(G) for i = 1, .........
0次引用 0 0
Hedetniemi’s Conjecture and Dense Boolean Lattices  
The category of finite directed graphs is Cartesian closed, hence it has a product and exponential objects. For a fixed K, let be the class of all directed graphs of the form K G , preordered by th......
A Journal on The Theory of Ordered Sets and Its Applications  2011
0次引用 0 0
Hedetniemi's conjecture and dense boolean lattices  
The category D of finite directed graphs is cartesian closed, hence it has a product and exponential objects. For a fixed K, let KD be the class of all directed graphs of the form KG, preordered by th......
0次引用 0 0

Feedback
Feedback
Feedback
我想反馈:
排行榜