Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A Note on the Pancyclism of Block Intersection Graphs for Universal Friendship Hypergraphs

P. C. Li1
1Dept. of Computer Science University of Manitoba Winnipeg, Manitoba Canada R3T 2N2
  • Published: 30/11/2012

Abstract

In this note, we consider the \(i\)-block intersection graphs (\(i\)-BIG) of a universal friendship \(3\)-hypergraph and show that they are pancyclic for \(i = 1,2\). We also show that the \(1\)-BIG of a universal friendship \(3\)-hypergraph is Hamiltonian-connected.

Citation
P. C. Li. A Note on the Pancyclism of Block Intersection Graphs for Universal Friendship Hypergraphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 083. 65-75. .