On some parameters related to matching of graph powers

DOI10.1080/09720529.2020.1741219MaRDI QIDQ5865708zbMATH OpenOpenAlexFDO

Authors Saeid Alikhani, Neda Soltani

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)

Abstract: Let $G=(V,E)$ be a simple connected graph. A matching of $G$ is a set of disjoint edges of $G$. For every $n,minmathbbN$, the $n$-subdivision of $G$ is a simple graph $G^{frac1n}$ which is constructed by replacing each edge of $G$ with a path of length $n$ and the $m$th power of $G$, denoted by $G^m$, is a graph with the same vertex set as $G$ such that two vertices are adjacent in $G^m$ if and only if their distance is at most $m$ in $G$. The $m^{th}$ power of the $n$-subdivision of $G$ has been introduced as a fractional power of $G$ and is denoted by $G^{fracmn}$. In this paper, we study some parameters related to matching of the natural and the fractional powers of some specific graphs. Also we study these parameters for power of graphs that are importance of in Chemistry.

Cites work

• Coloring Powers of Chordal Graphs
• Distinguishing number and distinguishing index of natural and fractional powers of graphs
• scientific article; zbMATH DE number 1445362 (Why is no real title available?)
• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• Matching theory
• On colorings of graph fractional powers
• Paths, Trees, and Flowers
• Sandwiching saturation number of fullerene graphs
• Saturation number of benzenoid graphs
• Some Hamiltonian results in powers of graphs
• The Wiener index of the \(k\)th power of a graph

Cited in

(1)

• scientific article; zbMATH DE number 1323481 (Why is no real title available?)

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

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