Acyclic and unicyclic graphs whose minimum skew rank is equal to the minimum skew rank of a diametrical path

Details Acyclic and unicyclic graphs whose minimum skew rank is equal to the minimum skew rank of a diametrical path Acyclic and unicyclic graphs whose minimum skew rank is equal to the minimum skew rank of a diametrical path

2011-07-12

arxiv.org/abs/1107.2170v1

Mathematics

Combinatorics

Scientific paper

The minimum skew rank of a simple graph G over the field of real numbers, is the smallest possible rank among all real skew-symmetric matrices whose (i,j)-entry (for i not equal to j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. In this paper we give an algorithm for computing the minimum skew rank of a connected unicyclic graph, and classify all connected acyclic and connected unicyclic graphs G, for which the minimum skew rank of G is equal to the minimum skew rank of P, where P is a diametrical path of G.

Affiliated with

Also associated with

No associations

Rating

Acyclic and unicyclic graphs whose minimum skew rank is equal to the minimum skew rank of a diametrical path does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Acyclic and unicyclic graphs whose minimum skew rank is equal to the minimum skew rank of a diametrical path, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Acyclic and unicyclic graphs whose minimum skew rank is equal to the minimum skew rank of a diametrical path will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-564699