Add to ORKG[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0166-218X&DestApp=JCR&RQ=IF_CAT_BOXPLO
Abstract An instance of Hamiltonian cycle problem can be solved by converting it to an instance of T...
For a connected graph G and a positive integer k, the kth power Gkof G is the graph with V (Gk) = V ...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
AbstractA Hamiltonian path of a graph G is a simple path that contains each vertex of G exactly once...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
AbstractLet G=(V,E) be a connected graph. The distance between two vertices x and y in G, denoted by...
AbstractIn this paper, we first present an O(n+m)-time sequential algorithm to solve the Hamiltonian...
Graph TheoryFor a positive integer n∈ℕ and a set D⊆ ℕ, the distance graph GnD has vertex set {...
AbstractLet G=(V,E) be a 2-connected simple graph and let dG(u,v) denote the distance between two ve...
Let G be a graph of order n and 3≤t≤n/4 be an integer. Recently, Kaneko and Yoshimoto [J Combin Theo...
AbstractGiven a fixed positive integer k≥2 and a fixed pair of vertices x and y in a graph of suffic...
For a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v), where d...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
[[abstract]]For any two points p and q in the Euclidean plane, define LUNpq = {v|v R2, dpv < dpq a...
AbstractFor a finite set D⊆N with gcd(D)=1, we prove the existence of some n∈N such that the distanc...
Abstract An instance of Hamiltonian cycle problem can be solved by converting it to an instance of T...
For a connected graph G and a positive integer k, the kth power Gkof G is the graph with V (Gk) = V ...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
AbstractA Hamiltonian path of a graph G is a simple path that contains each vertex of G exactly once...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
AbstractLet G=(V,E) be a connected graph. The distance between two vertices x and y in G, denoted by...
AbstractIn this paper, we first present an O(n+m)-time sequential algorithm to solve the Hamiltonian...
Graph TheoryFor a positive integer n∈ℕ and a set D⊆ ℕ, the distance graph GnD has vertex set {...
AbstractLet G=(V,E) be a 2-connected simple graph and let dG(u,v) denote the distance between two ve...
Let G be a graph of order n and 3≤t≤n/4 be an integer. Recently, Kaneko and Yoshimoto [J Combin Theo...
AbstractGiven a fixed positive integer k≥2 and a fixed pair of vertices x and y in a graph of suffic...
For a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v), where d...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
[[abstract]]For any two points p and q in the Euclidean plane, define LUNpq = {v|v R2, dpv < dpq a...
AbstractFor a finite set D⊆N with gcd(D)=1, we prove the existence of some n∈N such that the distanc...
Abstract An instance of Hamiltonian cycle problem can be solved by converting it to an instance of T...
For a connected graph G and a positive integer k, the kth power Gkof G is the graph with V (Gk) = V ...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...