ScholarLens Back to search
1999•Joural of Yuzhou UniversityRequires access

The Distribution of the Eigenvalues of the Complement Graph of a Complete Bipartite Graph

Kun Fang

Open publisher page 0 citations

Abstract

Let G be a connected and simple graph with p order, the complement graph G is the union of a complete bipartite graph K n,m and an empty graph K. The distribution of the eigenvalues of the graph G by using the properties of the spectra of a complete bipartite graph is obtained.

About this research paper

What this paper is about

Let G be a connected and simple graph with p order, the complement graph G is the union of a complete bipartite graph K n,m and an empty graph K. The distribution of the eigenvalues of the graph G by using the properties of the spectra of a complete bipartite graph is obtained.

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

Let G be a connected and simple graph with p order, the complement graph G is the union of a complete bipartite graph K n,m and an empty graph K. The distribution of the eigenvalues of the graph G by using the properties of the spectra of a complete bipartite graph is obtained.

Key concepts: Combinatorics, Mathematics, Voltage graph, Edge-transitive graph, Complement graph, Bipartite graph, Complete bipartite graph, Simplex graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Distribution of the Eigenvalues of the Complement Graph of a Complete Bipartite Graph — Research Paper | ScholarLens