ScholarLens Back to search
2020•International Journal of Advanced Research in Computer ScienceOpen access

THE (n-1)/2-REGULAR GRAPH ON n VERTICES

An D. Nhu

Open full text 0 citations

Abstract

Letbe an undirected and simple graph on vertices and degree of each vertex is equal .We present some properties of and confirm that is a Hamiltonian graph.

Open-access reader

About this research paper

What this paper is about

Letbe an undirected and simple graph on vertices and degree of each vertex is equal .We present some properties of and confirm that is a Hamiltonian graph.

Why it matters

A significance statement is not available in the OpenAlex record.

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

Letbe an undirected and simple graph on vertices and degree of each vertex is equal .We present some properties of and confirm that is a Hamiltonian graph.

Key concepts: Computer science, Combinatorics, Undirected graph, Regular graph, Graph, Wheel graph, Vertex (graph theory), Quartic graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
THE (n-1)/2-REGULAR GRAPH ON n VERTICES — Research Paper | ScholarLens