[PDF] Top 20 On the extremal number of edges in hamiltonian connected graphs

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

... 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 follow ...subset ... See full document

... Introduction In this work, a network is represented as a loopless undirected ...subset of { ( u , v) | ( u , v) is an unordered pair of V ...is the vertex set and E is the edge ... See full document

... k-regular Hamiltonian and Hamiltonian connected graph G is optimal fault-tolerant Hamiltonian and Hamiltonian connected if G remains Hamiltonian af- ter removing at most k ... See full document

... Graphs in this paper are nite, undirected, loopless and without parallel ...edges. The term multigraph is used for that with parallel ...[2]. The following question was asked by ... See full document

... Introduction In many parallel computer systems, processors are connected on the basis of inter- connection networks such as meshes, hypercubes, star graphs, bubble-sort networks, ... See full document

... is the subgraph of G with its vertex set S and with its edge set consisting of all edges of G joining any two vertices in ...denote the subgraph of G induced by V − ... See full document

... are the only 2-edge-connected outerplanar graphs that are upper- extremal and have cycle packing number ...define the simplified graph of a graph G to be the graph ... See full document

... Introduction In many parallel computer systems, processors are connected on the basis of in- terconnection networks such as hypercubes, star graphs, meshes, bubble-sort ... See full document

... where the faults can be vertices and ...to the n-dimensional star graph, which is bipartite and thus cannot tolerate any vertex fault when embedding Hamiltonian cycles and ...graph of degree d ... See full document

... Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan, ROC Abstract A k-regular Hamiltonian and Hamiltonian connected graph G is super ... See full document

... 2. Extremal 2-connected graphs of diameter 2 A 2-connected graph G of diameter 2 is called extremal if and only if m(G) = 2n(G) − ...a connected graph with m(G) = ... See full document

... Keywords: Graph layout, wire area, long edges, lower bound, shuffle-exchange, cube-connected cycles, path-edge, communica- tion power of edge, VLSI.. 1..[r] ... See full document

... The Hamiltonian property is one of major requirements in designing the topology of ...systems. In this paper, we introduce the concepts of (node, edge) ... See full document

... 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

... On The Domatic Number of Bipartite Permutation Graphs Kai Wen Tsui 1 and William Chung-Kung Yen 2 and Chuan Yi Tang 3 1 Department of Computer Science, National Tsing Hua ... See full document

... Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan 30010, ROC b Department of Mathematics, National Central University, Chungli, Taiwan 32001, ROC c Department of ... See full document

... Besides, it is also interesting to study the maximum connected interval subgraph problem on other special graphs such as permutation graphs and chordal graphs or even the split graphs.. [r] ... See full document

... proving the above ...vertex in Y and P 0 ends at a vertex in Z. In both cases, the following path is an (X, Y )-canonical (HP, s, ... See full document

... property of recursive circulant graphs Chang-Hsiung Tsai a, ∗ , Jimmy ...Department of Computer Science and Information Engineering, Dahan Institute of Technology, Hualien 971, Taiwan, ROC b ... See full document