Minimum Rank of Graphs with Loops

Thumbnail Image
Date
2014-12-01
Authors
Bozeman, Chassidy
Ellsworth, AnnaVictoria
Lin, Jephian
Maurer, Gabi
Nowak, Kathleen
Rodriguez, Aaron
Strickland, James
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Authors
Person
Hogben, Leslie
Associate Dean
Research Projects
Organizational Units
Organizational Unit
Electrical and Computer Engineering

The Department of Electrical and Computer Engineering (ECpE) contains two focuses. The focus on Electrical Engineering teaches students in the fields of control systems, electromagnetics and non-destructive evaluation, microelectronics, electric power & energy systems, and the like. The Computer Engineering focus teaches in the fields of software systems, embedded systems, networking, information security, computer architecture, etc.

History
The Department of Electrical Engineering was formed in 1909 from the division of the Department of Physics and Electrical Engineering. In 1985 its name changed to Department of Electrical Engineering and Computer Engineering. In 1995 it became the Department of Electrical and Computer Engineering.

Dates of Existence
1909-present

Historical Names

  • Department of Electrical Engineering (1909-1985)
  • Department of Electrical Engineering and Computer Engineering (1985-1995)

Related Units

Organizational Unit
Mathematics
Welcome to the exciting world of mathematics at Iowa State University. From cracking codes to modeling the spread of diseases, our program offers something for everyone. With a wide range of courses and research opportunities, you will have the chance to delve deep into the world of mathematics and discover your own unique talents and interests. Whether you dream of working for a top tech company, teaching at a prestigious university, or pursuing cutting-edge research, join us and discover the limitless potential of mathematics at Iowa State University!
Journal Issue
Is Version Of
Versions
Series
Abstract

A loop graph S is a finite undirected graph that allows loops but does not allow multiple edges. The set S(S) of real symmetric matrices associated with a loop graph of order n is the set of symmetric matrices A = [a(ij)] is an element of R-nxn such that a(ij) not equal 0 if and only if ij is an element of E(S). The minimum (maximum) rank of a loop graph is the minimum (maximum) of t he ranks of the matrices in S(S). Loop graphs having minimum rank at most two are characterized (by forbidden induced subgraphs and graph complements) and loop graphs having minimum rank equal to the order of the graph are characterized. A Schur complement reduction technique is used to determine the minimum ranks of cycles with various loop configurations; the minimum ranks of complete graphs and paths with various configurations of loops are also determined. Unlike simple graphs, loop graphs can have maximum rank less than the order of the graph. Some results are presented on maximum rank and which ranks between minimum and maximum can be realized. Interesting open questions remain.

Comments

This article is published as Bozeman, Chassidy, AnnaVictoria Ellsworth, Leslie Hogben, Jephian Chin-Hung Lin, Gabi Maurer, Kathleen Nowak, Aaron Rodriguez, and James Strickland. "Minimum rank of graphs with loops." The Electronic Journal of Linear Algebra 27 (2014): 907-934. DOI: 10.13001/1081-3810.2007. Posted with permission.

Description
Keywords
Citation
DOI
Subject Categories
Copyright
Wed Jan 01 00:00:00 UTC 2014
Collections