Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Graph Structural Properties of Non-Yutsis Graphs Allowing Fast Recognition

Date

Authors

Aldred, R E L

Van Dyck, D

Brinkmann, Gunnar

McKay, Brendan

Publisher

Elsevier

Abstract

Yutsis graphs are connected simple graphs which can be partitioned into two vertex-induced trees. Cubic Yutsis graphs were introduced by Jaeger as cubic dual Hamiltonian graphs, and these are our main focus. Cubic Yutsis graphs also appear in the context

Keywords

Keywords: Graph theory; Hamiltonians; Heuristic methods; Nuclear propulsion; Quantum theory; Benchmarking algorithms; Construction techniques; Cubic graphs; Decision problem; Decision problems; Dual Hamiltonian graph; Dual hamiltonian graphs; Experimental evidences Decision problem; Dual Hamiltonian graph; General recoupling coefficient; Yutsis graph

URI

http://hdl.handle.net/1885/35306

Collections

ANU Research Publications

Source

Discrete Applied Mathematics

Type

Journal article

DOI

10.1016/j.dam.2008.03.020

Restricted until

2037-12-31

Downloads

File

Description

01_Aldred_Graph_Structural_Properties_of_2008.pdf (719.76 KB)