Perfect matching transitivity of circulant graphs

DOI10.5614/EJGTA.2022.10.2.14MaRDI QIDQ5054051zbMATH OpenOpenAlexFDO

Authors Isaac Armando Reiter, Ju Zhou

Publication date 29 November 2022

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.5614/ejgta.2022.10.2.14

zbMATH Keywords

automorphismperfect matchingcirculant graphedge-transitivevertex-transitiveperfect matching transitivityPM-transitive

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Characterization of perfect matching transitive graphs
• Graphs that contain multiply transitive matchings
• Dimension of the perfect matching polytope of graphs
• scientific article; zbMATH DE number 2076912
• On the perfect matching graph defined by a set of cycles

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 193034 (Why is no real title available?)
• scientific article; zbMATH DE number 1952951 (Why is no real title available?)
• scientific article; zbMATH DE number 1750091 (Why is no real title available?)
• scientific article; zbMATH DE number 3349883 (Why is no real title available?)
• A conjecture concerning a limit of non-Cayley graphs
• A graph which is edge transitive but not arc transitive
• Characterization of perfect matching transitive graphs
• Cubic vertex-transitive graphs on up to 1280 vertices
• Handbook of Graph Theory
• On a closure concept in claw-free graphs
• The classification of Hamiltonian generalized Petersen graphs
• Vertex and Edge Transitive, but not 1-Transitive, Graphs

Cited in

(4)

• Cyclic matching sequencibility of graphs
• Graphs that contain multiply transitive matchings
• Dimension of the perfect matching polytope of graphs
• Characterization of perfect matching transitive graphs

This page was built for publication: Perfect matching transitivity of circulant graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054051)