On some parameters related to matching of graph powers

DOI10.1080/09720529.2020.1741219zbMath1487.05202arXiv1806.00330OpenAlexW3031844943MaRDI QIDQ5865708

Neda Soltani, Saeid Alikhani

Publication date: 9 June 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.00330

zbMATH Keywords

matchingpower of a graphsubdivision of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On colorings of graph fractional powers
• Matching theory
• The Wiener index of the \(k\)th power of a graph
• Distinguishing number and distinguishing index of natural and fractional powers of graphs
• Sandwiching saturation number of fullerene graphs
• Coloring Powers of Chordal Graphs
• Paths, Trees, and Flowers
• Some Hamiltonian results in powers of graphs

This page was built for publication: On some parameters related to matching of graph powers