Excessive index for mesh derived networks

DOI10.1016/J.JDA.2014.07.001zbMath1337.05087OpenAlexW2088435985MaRDI QIDQ491612

Albert Muthumalai, A. S. Shanthi, Indra Rajasingh

Publication date: 18 August 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2014.07.001

zbMATH Keywords

matchingtoruscylindermeshperfect matchingexcessive index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• On excessive index of certain networks
• Graphs of arbitrary excessive class
• 1-factor covers of regular graphs
• Excessive near 1-factorizations
• The excessive [3-index of all graphs]
• On minimum sets of 1-factors covering a complete multipartite graph
• The NP-Completeness of Edge-Coloring
• Graphs with 1-Factors
• Some remarks about factors of graphs
• On the 1-factors of a non-separable graph
• The Factorization of Linear Graphs

This page was built for publication: Excessive index for mesh derived networks