Add to ORKG[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0028-3045&DestApp=JCR&RQ=IF_CAT_BOXPLO
[[abstract]]In this paper, we construct the variant of hypercube X(Qn; fxb; xwg) with node expansion...
AbstractA bipartite graph is Hamiltonian laceable if there exists a Hamiltonian path joining every p...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
In this paper, we present three construction schemes for fault-tolerant Hamiltonian graphs. We show ...
... In this paper, we discuss the case of a combination of processor failures and link failures for...
Abstract—The arrangement graph An,k, which is a generalization of the star graph (n- k = 1), present...
设 G是一个n阶k连通图(k 2). 于1980年 J. A. Bondy证明: 若σk+1 > (k+1) (n-1) / 2, 则G是Hamilton图.本文证明对于坚韧图G, 若σk+1 ...
Abstract It is important for a network to tolerate as many faults as possible. With the graph repres...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
A path in G is a hamiltonian path if it contains all vertices of G. A graph G is hamiltonian connect...
In this paper, we consider the fault Hamiltonicity, and the fault Hamiltonian connectivity of the (n...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
In modeling communication networks by graphs, the problem of designing s-fault-tolerant networks be...
Methods are presented to embed Hamiltonian paths (H-paths) and Hamiltonian cycles (H-cycles) in a st...
[[abstract]]In this paper, we construct the variant of hypercube X(Qn; fxb; xwg) with node expansion...
AbstractA bipartite graph is Hamiltonian laceable if there exists a Hamiltonian path joining every p...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
In this paper, we present three construction schemes for fault-tolerant Hamiltonian graphs. We show ...
... In this paper, we discuss the case of a combination of processor failures and link failures for...
Abstract—The arrangement graph An,k, which is a generalization of the star graph (n- k = 1), present...
设 G是一个n阶k连通图(k 2). 于1980年 J. A. Bondy证明: 若σk+1 > (k+1) (n-1) / 2, 则G是Hamilton图.本文证明对于坚韧图G, 若σk+1 ...
Abstract It is important for a network to tolerate as many faults as possible. With the graph repres...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
A path in G is a hamiltonian path if it contains all vertices of G. A graph G is hamiltonian connect...
In this paper, we consider the fault Hamiltonicity, and the fault Hamiltonian connectivity of the (n...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
In modeling communication networks by graphs, the problem of designing s-fault-tolerant networks be...
Methods are presented to embed Hamiltonian paths (H-paths) and Hamiltonian cycles (H-cycles) in a st...
[[abstract]]In this paper, we construct the variant of hypercube X(Qn; fxb; xwg) with node expansion...
AbstractA bipartite graph is Hamiltonian laceable if there exists a Hamiltonian path joining every p...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...