The Minimum Skew Rank of Simple Graphs to Strict Powers
MetadataShow full item record
Every simple graph can be represented by an adjacency matrix. The minimum skew rank of a graph is the smallest possible rank of all skew-symmetric matrices whose non-zero entries correspond to edges of the graph. Extensive work has established methods for finding the minimum skew rank of simple graphs. The strict power of a graph, G(S) is generated by walks of exactly s steps on G. We examined the minimum skew rank of strict powers of paths using known results for n-partite complete graphs, forbidden subgraphs, algorithms for edge coverings and cut vertex reduction. We will present our method of using Wolfram Mathematica to generate the strict powers of graphs and discuss the patterns discovered in the minimum skew rank of such graphs.
Showing items related by title, author, creator and subject.
Manley, Eric D.; Gormley, John (MICS, 2014-04)Network coding, a relatively new paradigm for transmitting information through communication networks, allowing intermediate nodes in the network to combine data received on separate incoming channels before transmitting ...
Manley, Eric D.; Holcomb, David; Grout, Jason; Hoyer, Alex (2012-09)Network coding is a networking paradigm which allows network nodes to combine different pieces of data at various steps in the transmission rather than simply copying and forwarding the data. Network coding has various ...
Manley, Eric D.; Janssen, William (MICS, 2011-04)Network coding is a relatively recent development in the realm of maximizing information transfer in communications and computer networks. Traditional networks operate by simply storing and forwarding data along. Network ...