Back to Search
Start Over
Conditional Fractional Matching Preclusion Number of Graphs.
Conditional Fractional Matching Preclusion Number of Graphs.
- Source :
-
International Journal of Foundations of Computer Science . Aug2024, p1-17. 17p. - Publication Year :
- 2024
-
Abstract
- The <italic>conditional fractional matching preclusion number</italic> (CFMP number for short) fmp1(G) of a graph G is the minimum number of edges whose deletion results in a graph without isolated vertices and without fractional perfect matchings. In this paper, we study the CFMP number of complete graphs, complete bipartite graphs and twisted cubes. Also, we give Nordhaus–Gaddum-type results for the CFMP numbers of general graphs. [ABSTRACT FROM AUTHOR]
- Subjects :
- *COMPLETE graphs
*NUMBER theory
*CUBES
*BIPARTITE graphs
Subjects
Details
- Language :
- English
- ISSN :
- 01290541
- Database :
- Academic Search Index
- Journal :
- International Journal of Foundations of Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 178820281
- Full Text :
- https://doi.org/10.1142/s0129054124500114