Article citationsMore>>

Williams, R. (2009) Finding a Path of Length k in O^*(2^K)Time. Information Processing Letters, 109, 315-318.
http://dx.doi.org/10.1016/j.ipl.2008.11.004

has been cited by the following article:

• TITLE: On the Number of Cycles in a Graph

  AUTHORS: Nazanin Movarraei, Samina A. Boxwala

  KEYWORDS: Adjacency Matrix, Cycle, Graph Theory, Path, Subgraph, Walk

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.6 No.2, March 31, 2016

  ABSTRACT: In this paper, we obtain explicit formulae for the number of 7-cycles and the total number of cycles of lengths 6 and 7 which contain a specific vertex vi in a simple graph G, in terms of the adjacency matrix and with the help of combinatorics.