GlobalView

Showing items 1 - 6 of 6.

Add to Quick Collection   All 6 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/916345
Description: A graph H of order h is an n-linked cycle if it has an induced subgraph G of order g < h and an automorphism α: H → H of order n ≥ 2 such that H = ⋃{αr(G) : 0 ≤ r < n} and G has an induced subgraph K ... More
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/916332
Description: A linked pair is a graph H = G₀ ⋃ G₁ formed from (1) a given finite graph G,(2) isomorphic induced proper subgraphs K and K*, not necessarily distinct, and (3) a graph isomorphism σ: K* → K. The graph... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: uon:6510
Description: The level set G(n,m) comprises all unlabelled simple graphs of order n and size m, and is partitioned into similarity classes, comprising all graphs with the same degree sequence. When graphs are orde... More
Reviewed: Reviewed
Date: 2006
Keyword: 05C99 | 05C07 | 06A07
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/803795
Description: Extending earlier data summaries for graphs of order n ≤ 9, this paper describes structural characteristics and relationships for the 12005168 graphs of order 10. It summarises data for their degree s... More
Reviewed: Reviewed
Date: 2004
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/803792
Description: The set G(n) of unlabelled simple graphs of order n is a poset with partial ordering G ≤ H whenever G is a spanning subgraph of H. On the website www.maths.uq.edu.au/~pa/research/poset9.html we have m... More
Reviewed: Reviewed
Date: 2004
Keyword: graph posets
Resource Type: journal article
Identifier: uon:1699
Description: The poset G(n) comprises the unlabelled simple graphs of order n, with partial ordering G ≤ H whenever G is a spanning subgraph of H. We define a modified Steinbach numbering of the graphs in G(n), ap... More
Reviewed: Reviewed
Image Thumbnail
  • First
  • Previous
  • 1
  • Next
  • Last