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...
Cartesian product of graphsrook’s graphVizing’s conjectureA k-tuple total dominating set (kTDS) of a graph G is a set S of vertices inwhich every vertex in G is adjacent to at least k vertices in S; the minimumsize of a kTDS is denoted γxk,t(G). We give a Vizing-like ...
Zˇerovnik, Factoring Cartesian-product graphs, J. Graph Theory 18 (1994), 557-567.Imrich W., Žerovnik J.: Factoring Cartesian-product graphs. J. Graph Theory 18 , 557–567 (1994) MathSciNet MATHWilfried Imrich , Janez erovnik, Factoring Cartesian-product graphs, Journal of Graph ...
cartesian productmaximally connectedA cyclic vertex-cut of a graph G is a vertex set S such that GS is disconnected and at least two of its components contain cycles. If G has a cyclic vertex-cut, then it is said to be cyclically separable. For a cyclically separable graph G, the ...
Cartesianproductgraphscanberecognizedefficiently,in timeO(mlogn)foragraphwithmedgesandnvertices (Aurenhammer,Hagauer&Imrich1992).Theoperation iscommutativeasanoperationonisomorphismclasses ofgraphs,andmorestronglythegraphsG□HandH □Garenaturallyisomorphic,butitisnotcommutative ...
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 ...
必应词典为您提供cartesian-product-graph的释义,网络释义: 笛卡尔积图;笛卡尔乘积图;
Outer-connected vertex edge domination numberCartesian product of graphsLet G be a simple, finite and connected graph. An outer-connected vertex edge dominating set, abbreviated OCVEDS of G is a subset D of vertices of G such that D is a vertex edge dominating set and the graph GD is ...
Cartesian product 英[kɑ:ˈti:zjən ˈprɔdʌkt] 美[kɑrˈtiʒən ˈprɑdəkt] 释义 笛卡儿积,笛卡尔乘积 大小写变形:cartesian product 实用场景例句 全部 In this paper, we study the crossing numbers of thecartesian productgraph. ...
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...