Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Fractional matching preclusion for generalized augmented cubes
View through CrossRef
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. As a generalization, Liu and Liu recently introduced the concept of fractional matching preclusion number. The \emph{fractional matching preclusion number} of $G$ is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The \emph{fractional strong matching preclusion number} of $G$ is the minimum number of vertices and edges whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the fractional matching preclusion number and the fractional strong matching preclusion number for generalized augmented cubes. In addition, all the optimal fractional strong matching preclusion sets of these graphs are categorized.Comment: 21 pages; 1 figures
Centre pour la Communication Scientifique Directe (CCSD)
Title: Fractional matching preclusion for generalized augmented cubes
Description:
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.
As a generalization, Liu and Liu recently introduced the concept of fractional matching preclusion number.
The \emph{fractional matching preclusion number} of $G$ is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching.
The \emph{fractional strong matching preclusion number} of $G$ is the minimum number of vertices and edges whose deletion leaves the resulting graph without a fractional perfect matching.
In this paper, we obtain the fractional matching preclusion number and the fractional strong matching preclusion number for generalized augmented cubes.
In addition, all the optimal fractional strong matching preclusion sets of these graphs are categorized.
Comment: 21 pages; 1 figures.
Related Results
Solving Undamped and Damped Fractional Oscillators via Integral Rohit Transform
Solving Undamped and Damped Fractional Oscillators via Integral Rohit Transform
Background: The dynamics of fractional oscillators are generally described by fractional differential equations, which include the fractional derivative of the Caputo or Riemann-Li...
Matching Preclusion for the Shuffle-Cubes
Matching Preclusion for the Shuffle-Cubes
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 ...
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 ...
MEMBANGUN BRAND EQUITY UMKM IKAN ASAP MENGGUNAKAN TEKNOLOGI AUGMENTED REALITY MELALUI LITERASI PEMASARAN
MEMBANGUN BRAND EQUITY UMKM IKAN ASAP MENGGUNAKAN TEKNOLOGI AUGMENTED REALITY MELALUI LITERASI PEMASARAN
Abstrak
UMKM merupakan salah satu roda penggerak perekenomian nasional. Terbukti bahwa UMKM telah membantu 61,97% PDB Indonesia. Namun sayangnya, masih banyak produsen yang memili...
On α-Fractional Bregman Divergence to study α-Fractional Minty’s Lemma
On α-Fractional Bregman Divergence to study α-Fractional Minty’s Lemma
In this paper fractional variational inequality problems (FVIP) and dual fractional variational inequality problems (DFVIP), Fractional minimization problems are defined with the h...
On the Cube Polynomials of Padovan and Lucas–Padovan Cubes
On the Cube Polynomials of Padovan and Lucas–Padovan Cubes
The hypercube is one of the best models for the network topology of a distributed system. Recently, Padovan cubes and Lucas–Padovan cubes have been introduced as new interconnectio...