Sign in
Back
Graph Structural Properties of Non-Yutsis Graphs Allowing Fast Recognition
Journal article   Peer reviewed

Graph Structural Properties of Non-Yutsis Graphs Allowing Fast Recognition

R E L Aldred, D Van Dyck, Gunnar Brinkmann and Brendan McKay
2008
DOI: https://doi.org/10.1016/j.dam.2008.03.020
Handle:
https://hdl.handle.net/10523/34704

Abstract

Benchmarking algorithms Construction techniques Cubic graphs Decision problem Decision problems Dual Hamiltonian graph Dual hamiltonian graphs Experimental evidences Decision problem General recoupling coefficient Hamiltonians Heuristic methods Keywords: Graph theory Nuclear propulsion Quantum theory Yutsis graph
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

Metrics

3 Record Views

Details

Usage Policy

Usage details for all content viewed and downloaded in this site are shared with IRUS-UK (Institutional Repository Usage Statistics UK). Cookies are used to remember your decision. Click Accept to accept usage details sharing and the cookies.

Learn more