[PDF] Top 20 On the Extremal Number of Edges in Hamiltonian Graphs
Has 10000 "On the Extremal Number of Edges in Hamiltonian Graphs" found on our website. Below are the top 20 most common "On the Extremal Number of Edges in Hamiltonian Graphs".
On the Extremal Number of Edges in Hamiltonian Graphs
... vertex of G exactly once. A graph is hamiltonian if it has a ham- iltonian ...cycle. In the past years, the studies on hamiltonian graphs have largely focused ... See full document
7
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
4
On some super fault-tolerant Hamiltonian graphs
... so on. These varia- tions preserve most of the good topological properties of the hypercube, and even ...example, the diameter of these variation cubes is around half ... See full document
13
Mutually orthogonal hamiltonian connected graphs
... is hamiltonian. Moreover, the only non-hamiltonian graphs with n vertices and C 2 n − 1 + 1 edges are C 1 , n and, for n = 5, C 2 , 5 ...orthogonal hamiltonian paths between any ... See full document
3
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
10
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
... 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, ...For ... See full document
17
The construction of mutually independent Hamiltonian cycles in bubble-sort graphs
... 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
16
The decycling number of outerplanar graphs
... be the decycling number of G and c(G) be the number of vertex-disjoint cycles of ...2c(G). In this paper, we provide a nec- essary and sufficient condition for an ... See full document
7
The study of strongly K-edge Hamiltonian graphs and hamiltonian laceable graphs 陳青輝、洪春男
... is the structure that connects the processors of parallel ...computer. The hypercube and star networks are the most fundamental topologies for interconnection ...based on these ... See full document
1
A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
... Introduction In many parallel computer systems, processors are connected on the basis of in- terconnection networks such as hypercubes, star graphs, meshes, bubble-sort net- ... See full document
11
Diagnosability of star graphs with missing edges
... 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
7
Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs
... view of A n;2 and then present some of its special ...consists of nðn 1Þ vertices and nðn 1Þðn 2Þ ...half of them are outer ...is the adjacent set of u.) On ... See full document
15
Mutually independent hamiltonian cycles for the pancake graphs and the star graphs
... Applications of the concept of mutually independent hamiltonian cycles Mutually independent hamiltonicity of graphs can be applied to many ...Consider the following ... See full document
10
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
... 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 − 2 vertices ... See full document
10
The Study of Edge Fault-Tolerance for Hamiltonian Cycles and Hamiltonian Paths Passing through Prescribed Edges of Star 游宗育、洪春男
... variation on the hypercube with lower diameter'', IEEE Transactions on Computers, ...routing on hypercubes,'' Journal of Combinatorial Theory, ...paths in Star Graphs with ... See full document
2
The decay number and the maximum genus of diameter 2 graphs
... that the preceding formula, together with Theorem 1.3, yields another proof of Theorem ...E(G) in Theorem 1:4). This paper concerns the extremal graphs of Theorems ...are ... See full document
7
Solution to an open problem on 4-ordered Hamiltonian graphs
... part of the proof relies on using a computer, we will now briefly mention the computation ...written in C. More importantly, we will now address how the computer results can be ... See full document
15
Optimal 1-Hamiltonian graphs
... A number of fault tolerant designs for specific multiprocessor architectures have been proposed based on graph theoretic models in which the processor-to-processor [r] ... See full document
5
Hamiltonian-Laceability in Star Graphs with Conditional Edge Faults
... Department of Electronics Engineering,National United University, Miaoli, Taiwan, ROC * E-mail address: ...ABSTRACT The star graph S n possess many nice topological properties. It is one of ... See full document
9
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs
... graph, in which the vertices correspond to processors/nodes, and the edges correspond to connections or communication ...links. In this paper, we use the terms, graphs and ... See full document
12
相關主題