[PDF] Top 20 THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES IN 2-TERMINAL SERIES-PARALLEL GRAPHS

... In this paper, both the 1-MVE problem and k-MVE problem are considered for a special class of graphs called two-terminal series-parallel graphs [5], The formal description of t[r] ... See full document

... Furthermore, from the one-to-one correspondence stated in lemma 1, it follows that the number of spanning trees of an undirected graph G containing a particular edge (u,v) equals [r] ... See full document

... tree of a 2-tree G. T is a canonical tree if and only if each P node of T has two children: one is an S node, and the other is a P node or a leaf ...prove the if part. If each P node ... See full document

... Department of Information and Computer Science, National Chiao Tung University, Hsinchu 30050, Taiwan, ROC.. Maw-Sheng Chern.[r] ... See full document

... Our mo- tivation was to study the effect on the cost of any com- binatonal optimization problem subject to the deletion of an edge in turn. * To whom correspondence should be[r] ... See full document

... b) to denote the number of combinations of “a” numbers taking “b” numbers at a time, where a, b are positive integers and a ≥ ...For the graph definitions and notations, we ... See full document

... On the extremal number of edges in hamiltonian connected graphs I Tung-Yang Ho a, ∗ , Cheng-Kuan Lin b , Jimmy ...Department of Information Management, Ta Hwa Institute ... See full document

... Department of Information Management, Kun-Shan University of Technology Abstract In this paper we construct a graph that consists of the maximum number of directed ... See full document

... Our new labeling method transforms the complement spanning tree matrix G into matrix whose left-upper submatrix is an identity matrix and whose right-lower submatr[r] ... See full document

... On the number of spanning trees of a multi-complete/star related graph Kuo-Liang Chung a,∗ , Wen-Ming Yan b,1 a Department of Information Management, Institute of ... See full document

... concerned with a particular family of regular 4-connected graphs, called chordal ...variation of ring networks. By adding extra two links (or chords) at each vertex in a ring network, ... See full document

... LQ 2_9__(_ WLPH ,Q >@ DQG >@ WKH DXWKRUV FRQMHFWXUHG WKDW DQ\ NFRQQHFWHG JUDSK KDV N LQGHSHQGHQW VSDQQLQJ WUHHV URRWHG DW DQ DUELWUDU\ YHUWH[ U 7KLV FRQMHFWXUH LV VWLOO RSHQ IRU DUELWUDU\ NFRQQHFWHG ... See full document

... All the schemes above require speed measurement. However, the speed measuring device is rather costly relative to the price of an induction motor in ...Besides, the ... See full document

... that the preceding formula, together with Theorem ...proof of Theorem 1.1 (take A = E(G) in Theorem ...concerns the extremal graphs of Theorems ...are the same, ... See full document

... broadcasting in a hypercube. Based on their algorithm, the source node sends the message to all its neighbors at ...Then, the neighbors in turn send the message to ... See full document

... Department of Computer Science, National Chiao Tung University, Hsinchu, 30010, Taiwan, ROC b Department of Computer and Information Science, Fordham University, New York, NY 10023, USA c Department ... See full document

... By the theorem above, we conclude that the diagnosability of S n is n  1 for n P 4; this is the same result as that obtained by Zheng et ...[20]. In some circumstances, some links ... See full document

... be the decycling number of G and c(G) be the number of vertex-disjoint cycles of ...≤ 2c(G) for an outerplanar graph ...= 2c(G). In this paper, we ... See full document

... CONCLUSION In this paper we study the DET problem that arises from VLSI ...1 to discuss the concatenation of these trail cover ...under series connection, parallel ... See full document

... Hassin and Tank’s unified approach for finding local solutions applies to a class of maximization problems that construct equivalence regions in various ways.. Our [r] ... See full document