ScholarLens Back to search
2015•Unpublished venueRequires access

Exploring random regular graphs with IONTW

Winfried Just, Hannah Lea Callender, Drew LaMar

Open publisher page 1 citations

Abstract

After clicking New you will see a picture of the complete graph K5 in the World window. In this graph each node i has degree ki = 4; it is a 4-regular graph. More generally, for every N the complete graph KN with N nodes is N − 1-regular. Now choose network-type → Empty Graph and click New again. You will see the empty graph K5. Each node in an empty graph has degree 0. Empty graphs are 0-regular. For a third example, choose network-type → Nearest-neighbor 1 num-nodes: 10 d: 2

About this research paper

What this paper is about

After clicking New you will see a picture of the complete graph K5 in the World window. In this graph each node i has degree ki = 4; it is a 4-regular graph. More generally, for every N the complete graph KN with N nodes is N − 1-regular. Now choose network-type → Empty Graph and click New again. You will see the empty graph K5. Each node in an empty graph has degree 0. Empty graphs are 0-regular. For a third example, choose network-type → Nearest-neighbor 1 num-nodes: 10 d: 2

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

After clicking New you will see a picture of the complete graph K5 in the World window. In this graph each node i has degree ki = 4; it is a 4-regular graph. More generally, for every N the complete graph KN with N nodes is N − 1-regular. Now choose network-type → Empty Graph and click New again. You will see the empty graph K5. Each node in an empty graph has degree 0. Empty graphs are 0-regular. For a third example, choose network-type → Nearest-neighbor 1 num-nodes: 10 d: 2

Key concepts: Regular graph, Combinatorics, Line graph, Random regular graph, Mathematics, Discrete mathematics, Block graph, Strongly regular graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Exploring random regular graphs with IONTW — Research Paper | ScholarLens