z-logo
open-access-imgOpen Access
On the shortest path in some k-connected graphs
Author(s) -
Kai An Sim,
Ta Sheng Tan,
Kok Bin Wong
Publication year - 2016
Publication title -
aip conference proceedings
Language(s) - English
Resource type - Conference proceedings
eISSN - 1551-7616
pISSN - 0094-243X
DOI - 10.1063/1.4954598
Subject(s) - combinatorics , path graph , mathematics , bound graph , distance , graph , induced path , wheel graph , connectivity , graph power , discrete mathematics , shortest path problem , longest path problem , line graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom