On Hamiltonian Properties of Powers of Special Hamiltonian Graphs,

Abstract

Several results on the powers of connected graphs are extended. In particular, it is shown that if G is an n-hamiltonian graph of order p > or = 5, then G sup m is (n+2m-2)-hamiltonian for all m > or = 1 and n + 2m < or = p - 1. Also, if G is an n-hamiltonian connected graph of order p, then for m > or = 3, the graph G sup m is (P - the set((p-n)/m))-hamiltonian connected. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1971
Accession Number
AD0732439

Entities

People

  • Gary Chartrand
  • S. F. Kapoor

Organizations

  • University of California, Santa Barbara

Tags

DTIC Thesaurus Topics

  • Behavior And Behavior Mechanisms
  • Behavioral Disciplines And Activities
  • Behavioral Sciences
  • Continents
  • Cooperation
  • Geographic Regions
  • Group Dynamics
  • Michigan
  • North America
  • Psychology

Readers

  • Calculus or Mathematical Analysis
  • Graph Algorithms and Convex Optimization.