Accession Number ADA573801
Title Lexicographic Product Cancellation Property for Digraphs.
Publication Date Dec 2012
Media Count 38p
Personal Author K. L. Manion
Abstract There are four prominent product graphs in graph theory: Cartesian, strong, direct and lexicographic. Of these four product graphs, the lexicographic product graph is the least studied. Lexicographic products are not commutative but still have some interesting properties. This paper begins with basic definitions of graph theory, including the definition of a graph, that are needed to understand theorems and proofs that come later. The paper then discusses the lexicographic product of digraphs, denoted G o H, for some digraphs G and H. The paper concludes by proving a cancellation property for the lexicographic product of digraphs G, H, A, and B: if G o H = A o B and /V(G)/ = /V(A)/, then G = A. It also proves additional cancellation properties for lexicographic product digraphs and the author hopes the final result will provide further insight into tournaments.
Keywords Cancellation properties
Digraphs
Graph theory
Graphs
Lexicography
Product graphs
Theses


 
Source Agency Non Paid ADAS
NTIS Subject Category 72B - Algebra, Analysis, Geometry, & Mathematical Logic
45F - Verbal
92D - Education, Law, & Humanities
88 - Library & Information Sciences
Corporate Author Virginia Commonwealth Univ., Richmond.
Document Type Thesis
Title Note Master's thesis.
NTIS Issue Number 1318
Contract Number N/A

Science and Technology Highlights

See a sampling of the latest scientific, technical and engineering information from NTIS in the NTIS Technical Reports Newsletter

Acrobat Reader Mobile    Acrobat Reader