Interlacement in 4-regular graphs: A new approach using nonsymmetric matrices

Downloadable Content

Download this item
Abstract
  • Let F be a 4-regular graph with an Euler system C. We introduce a simple way to modify the interlacement matrix of C so that every circuit partition P of F has an associated modified interlacement matrix M (C, P). If C and C' are Euler systems of F then M(C, C') and M(C', C) are inverses, and for any circuit partition P, M (C', P) = M (C',C) . M(C, P). This machinery allows for short proofs of several results regarding the linear algebra of interlacement.
TitleInterlacement in 4-regular graphs: A new approach using nonsymmetric matrices
CreatorTraldi, Lorenzo
PublisherContributions to Discrete Mathematics
Academic DepartmentMathematics
DivisionNatural Sciences
OrganizationLafayette College
Date Issued2014
Date Available2014-11-10T20:22:50Z
TypeArticle
LanguageEnglish
Keywordinterlacement
circuit partition
4-regular graph
Euler system
Bibliographic CitationTraldi, L. (2014) "Interlacement in 4-regular graphs: A new approach using nonsymmetric matrices." Contributions to Discrete Mathematics 9 (1): 85-97.
Standard IdentifierHandle 10385/1481
Permalinkhttp://hdl.handle.net/10385/1481
Rights Statement In Copyright In Copyright
Rights HoldersUniversity of Calgary
Contains
File Traldi-ContributionstoDiscreteMathematics-vol9-2014.pdf Uploaded 2019-10-20 Public Download

Member of Collection

Faculty Publications

View Collection