Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Matching Preclusion for the Shuffle-Cubes
View through CrossRef
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. A graph is maximally matched if its matching preclusion number is equal to its minimum degree, and is super matched if the matching preclusion number can only be achieved by deleting all edges incident to a single vertex. In this paper, we determine the matching preclusion number and classify the optimal matching preclusion sets for the shuffle-cube graphs, a variant of the well-known hypercubes.
World Scientific Pub Co Pte Ltd
Title: Matching Preclusion for the Shuffle-Cubes
Description:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
A graph is maximally matched if its matching preclusion number is equal to its minimum degree, and is super matched if the matching preclusion number can only be achieved by deleting all edges incident to a single vertex.
In this paper, we determine the matching preclusion number and classify the optimal matching preclusion sets for the shuffle-cube graphs, a variant of the well-known hypercubes.
Related Results
Fractional matching preclusion for generalized augmented cubes
Fractional matching preclusion for generalized augmented cubes
The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. A...
Ruffle: Rapid 3-Party Shuffle Protocols
Ruffle: Rapid 3-Party Shuffle Protocols
Secure shuffle is an important primitive that finds use in several applications such as secure electronic voting, oblivious RAMs, secure sorting, to name a few. For time-sensitive ...
A Concise Survey of Matching Preclusion in Interconnection Networks
A Concise Survey of Matching Preclusion in Interconnection Networks
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. There ar...
On multi‐cycle test cubes
On multi‐cycle test cubes
This article studies the generation of test sets that consist of multi‐cycle test cubes. Such test cubes have partially‐specified scan‐in states, and several functional clock cycle...
Horadam–Lucas Cubes
Horadam–Lucas Cubes
In this paper, we introduce a novel class of graphs referred to as the Horadam–Lucas cubes. This class extends the concept of Lucas cubes and retains numerous desirable properties ...
Video Indexing through Human Faces by Combined Deep Learning Neural Networks
Video Indexing through Human Faces by Combined Deep Learning Neural Networks
This research aims to suggest an algorithm that uses the human face as a cue for detecting faces and recognition from input video. Face recognition has become popular because it ha...
Residual-Shuffle Network with Spatial Pyramid Pooling Module for COVID-19 Screening
Residual-Shuffle Network with Spatial Pyramid Pooling Module for COVID-19 Screening
Since the start of the COVID-19 pandemic at the end of 2019, more than 170 million patients have been infected with the virus that has resulted in more than 3.8 million deaths all ...
Pengaruh Latihan Leddericky shuffle dan Lari Segitiga Terhadap Kemampuan Menggiring Bola Mahasiswa Penjaskesrek Unmul
Pengaruh Latihan Leddericky shuffle dan Lari Segitiga Terhadap Kemampuan Menggiring Bola Mahasiswa Penjaskesrek Unmul
Penelitian ini bertujuan untuk mengetahui; (1) Apakah ada pengaruh latihan ledder icky shuffle terhadap kemampuan menggiring bola dalam permainan sepak bola MAHASISWA PENJASKESREKU...