Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-19T02:54:21.660Z Has data issue: false hasContentIssue false

Randomly k-axial graphs

Published online by Cambridge University Press:  17 April 2009

David Burns
Affiliation:
Department of Mathematics, School of General Education, Ferris State College, Big Rapids, Michigan 49307, USA
Gary Chartrand
Affiliation:
Department of Mathematics, Western Michigan University, Kalamazoo, Michigan 49008, USA.
S.F. Kapoor
Affiliation:
Department of Mathematics, Western Michigan University, Kalamazoo, Michigan 49008, USA.
Farrokh Saba
Affiliation:
Department of Mathematics, Western Michigan University, Kalamazoo, Michigan 49008, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A class of graphs called randomly k-axial graphs is introduced, which generalizes randomly traceable graphs. The problems of determining which bipartite graphs and which complete n-partite graphs are randomly k-axial are studied.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1981