必应词典为您提供cartesian-product-graph的释义,网络释义: 笛卡尔积图;笛卡尔乘积图;
4) Cartesian product graph 笛卡尔积图 1. In this paper,we proved that the total chromatic number and adjacent strong edge chromatic number of Cartesian product graph of cycle Cm and cycle C5n. 证明了圈Cm与圈C5n的笛卡尔积图的全色数和邻强边色数都为5。 2. We study the star-edge ...
1)Cartesian product graph笛卡尔积图 1.In this paper,we proved that the total chromatic number and adjacent strong edge chromatic number of Cartesian product graph of cycle Cm and cycle C5n.证明了圈Cm与圈C5n的笛卡尔积图的全色数和邻强边色数都为5。 2.We study the star-edge coloring of Cart...
1) Cartesian product graph 笛卡尔积图1. In this paper,we proved that the total chromatic number and adjacent strong edge chromatic number of Cartesian product graph of cycle Cm and cycle C5n. 证明了圈Cm与圈C5n的笛卡尔积图的全色数和邻强边色数都为5。
1) Cartesian product graph Cartesian乘积图 2) CA CA 1. Effect of Ca on Compressive Creep Behavior of AE41 Alloy; Ca对AE41合金压蠕变行为的影响 2. Effects of Sn and Ca Addition on Microstructural Stability of ZA62 Magnesium Alloy;
The Cartesian product of graphs.In graph theory,the Cartesian product G□H of graphs G and H is a graph such that •the vertex set of G□H is the Cartesian product V(G)×V(H);and •any two vertices(u,u')and(v,v')are adjacent in G□ H if and only if either •u=v and...
Bounds on the metric dimension of the Cartesian product of cycles and graphs are established and exact values axe given when both graphs are cycles.Joel Peters-FransenOrtrud R. OellermanntUtilitas mathematicaJ. Peters-Fransen and O.R. Oellermann, The metric dimension of Cartesian products of ...
othermediangraph. •Thegraphofverticesandedgesofann-prismisthe CartesianproductgraphK 2 □C . •Therook’sgraphistheCartesianproductoftwo completegraphs. 2Properties IfaconnectedgraphisaCartesianproduct,itcanbefac- torizeduniquelyasaproductofprimefactors,graphsthat cannotthemselvesbedecomposedasproductsof...
We also prove that this factorization can be computed in O(m) time, where m is the number of edges of the given graph.doi:10.26493/1855-3974.715.c3dTetiana BoikoJohannes CunoWilfried ImrichFlorian LehnerChristiaan E. van de Woestijne
1 fori = 1,2. 2004 Elsevier B.V. All rights reserved.Keywords: Diameter; Connectivity; Fault diameter; Cartesian product graph; Interconnection networks1. IntroductionWe follow [1] for graph-theoretical terminologyandnotationnotdefinedhere.Throughoutthis paper,agraphG = (V,E) always meansa ...