scholarly journals Fractional Strong Matching Preclusion of Split-Star Networks

2019 ◽  
Vol 11 (4) ◽  
pp. 32
Author(s):  
Ping Han ◽  
Yuzhi Xiao ◽  
Chengfu Ye ◽  
He Li
Keyword(s):  
Perfect Matching ◽  
Minimum Size ◽  
Star Networks ◽  
Minimum Number

The matching preclusion number of graph G is the minimum size of edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching. Let F be an edge subset and F′ be a subset of edges and vertices of a graph G. If G − F and G − F′ have no fractional matching preclusion, then F is a fractional matching preclusion (FMP) set, and F ′is a fractional strong matching preclusion (FSMP) set of G. The FMP (FSMP) number of G is the minimum number of FMP (FSMP) set of G. In this paper, we study fractional matching preclusion number and fractional strong matching preclusion number of split-star networks. Moreover, We categorize all the optimal fractional strong matching preclusion sets of split-star networks.

Fractional Strong Matching Preclusion for DHcube

2021 ◽  
Vol 31 (01) ◽  
pp. 2150001
Author(s):  
He Zhang ◽  
Jinyu Zou ◽  
Shuangshuang Zhang ◽  
Chengfu Ye
Keyword(s):  
Perfect Matching ◽  
Minimum Size ◽  
Fractional Perfect Matching

Let [Formula: see text] be a set edges and [Formula: see text] be a set of edges and/or vertices of a graph [Formula: see text], then [Formula: see text] (resp. [Formula: see text]) is a fractional matching preclusion set (resp. fractional strong matching preclusion set) if [Formula: see text] (resp. [Formula: see text]) contains no fractional perfect matching. The fractional matching preclusion number (resp. fractional strong matching preclusion number) of [Formula: see text] is the minimum size of fractional matching preclusion set (resp. fractional strong matching preclusion set) of [Formula: see text]. In this paper, we obtain the fractional matching preclusion number and fractional strong matching preclusion number of the DHcube [Formula: see text] for [Formula: see text]. In addition, all the optimal fractional matching preclusion sets and fractional strong matching preclusion sets of these graphs are categorized.

Matching Preclusion Number of Radix Triangular Mesh with Odd Vertices

2018 ◽  
Vol 18 (02n03) ◽  
pp. 1850010
Author(s):  
CHUNXIA WANG ◽  
YALAN LI ◽  
SHUMIN ZHANG ◽  
CHENGFU YE ◽  
XIA WANG
Keyword(s):  
Perfect Matching ◽  
Triangular Mesh ◽  
Minimum Number

The matching preclusion number of graph G is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching or almost-perfect matching. The strong matching preclusion number of a graph G is the minimum number of vertices and edges whose deletion leaves the resulting graph without a perfect matching or an almost-perfect matching. The conditional matching preclusion number of G is the minimum number of edges whose deletion leaves the resulting graph with no isolated vertices and without a perfect matching or almost-perfect matching. In this paper, we study the matching preclusion number of radix triangular mesh with an odd number of vertices, and strong matching preclusion number and conditional matching preclusion number of radix triangular mesh. Also, we obtained the radix triangular mesh with an even number of vertices is super strongly matched and conditionally super matched.

IDENTIFYING CO-REGULATING MICRORNA GROUPS

2010 ◽  
Vol 08 (01) ◽  
pp. 99-115 ◽  
Author(s):  
JIYUAN AN ◽  
KWOK PUI CHOI ◽  
CHRISTINE A. WELLS ◽  
YI-PING PHOEBE CHEN
Keyword(s):  
Neurodegenerative Diseases ◽  
Target Genes ◽  
Signal To Noise Ratio ◽  
Statistical Tests ◽  
False Positive Rate ◽  
Target Prediction ◽  
Minimum Size ◽  
Supplementary Information ◽  
P Value ◽  
Minimum Number

Background: Current miRNA target prediction tools have the common problem that their false positive rate is high. This renders identification of co-regulating groups of miRNAs and target genes unreliable. In this study, we describe a procedure to identify highly probable co-regulating miRNAs and the corresponding co-regulated gene groups. Our procedure involves a sequence of statistical tests: (1) identify genes that are highly probable miRNA targets; (2) determine for each such gene, the minimum number of miRNAs that co-regulate it with high probability; (3) find, for each such gene, the combination of the determined minimum size of miRNAs that co-regulate it with the lowest p-value; and (4) discover for each such combination of miRNAs, the group of genes that are co-regulated by these miRNAs with the lowest p-value computed based on GO term annotations of the genes. Results: Our method identifies 4, 3 and 2-term miRNA groups that co-regulate gene groups of size at least 3 in human. Our result suggests some interesting hypothesis on the functional role of several miRNAs through a "guilt by association" reasoning. For example, miR-130, miR-19 and miR-101 are known neurodegenerative diseases associated miRNAs. Our 3-term miRNA table shows that miR-130/19/101 form a co-regulating group of rank 22 (p-value =1.16 × 10-2). Since miR-144 is co-regulating with miR-130, miR-19 and miR-101 of rank 4 (p-value = 1.16 × 10-2) in our 4-term miRNA table, this suggests hsa-miR-144 may be neurodegenerative diseases related miRNA. Conclusions: This work identifies highly probable co-regulating miRNAs, which are refined from the prediction by computational tools using (1) signal-to-noise ratio to get high accurate regulating miRNAs for every gene, and (2) Gene Ontology to obtain functional related co-regulating miRNA groups. Our result has partly been supported by biological experiments. Based on prediction by TargetScanS, we found highly probable target gene groups in the Supplementary Information. This result might help biologists to find small set of miRNAs for genes of interest rather than huge amount of miRNA set. Supplementary Information:.

Fractional Matching Preclusion for (n, k)-Star Graphs

2018 ◽  
Vol 28 (04) ◽  
pp. 1850017 ◽  
Author(s):  
Tianlong Ma ◽  
Yaping Mao ◽  
Eddie Cheng ◽  
Jinling Wang
Keyword(s):  
Perfect Matching ◽  
Perfect Matchings ◽  
Star Graphs ◽  
Minimum Number ◽  
Fractional Perfect Matching

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. As a generalization, Liu and Liu introduced the concept of fractional matching preclusion number in 2017. The Fractional Matching Preclusion Number (FMP number) of G is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The Fractional Strong Matching Preclusion Number (FSMP number) of G is the minimum number of vertices and/or edges whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the FMP number and the FSMP number for (n, k)-star graphs. In addition, all the optimal fractional strong matching preclusion sets of these graphs are categorized.

Fractional Matching Preclusion for Folded Petersen Cube Networks

2020 ◽  
Vol 20 (04) ◽  
pp. 2150003
Author(s):  
JINYU ZOU ◽  
CHENGFU YE ◽  
HAIZHEN REN
Keyword(s):  
Interconnection Networks ◽  
Perfect Matching ◽  
Interconnection Network ◽  
Minimum Size ◽  
Link Failures ◽  
Edge Failure ◽  
Fractional Perfect Matching

Let F be an edge set and F′ a subset of edges and/or vertices of a graph G. Then F is a fractional matching preclusion(FMP) set (F′ is a fractional strong matching preclusion (FSMP) set) if G − F (G − F′) does not contain fractional perfect matching. The FMP(FSMP) number of G is the minimum size of FMP(FSMP) sets of G. The concept of matching preclusion was introduced by Brigham et al., as a measure of robustness in the event of edge failure in interconnection networks. An interconnection network of a larger MP number may be considered as more robust in the event of link failures. The problem of fractional matching preclusion is a generalization of matching preclusion. In this paper, we obtain the FMP and FSMP number for the folded Petersen cube networks. All the optimal fractional strong matching preclusion sets of these graphs are categorized.

scholarly journals Optimal Testing and Design of Adders

VLSI Design ◽  
1994 ◽  
Vol 1 (4) ◽  
pp. 285-298 ◽  
Author(s):  
Michael J. Batek ◽  
John P. Hayes
Keyword(s):  
Performance Optimization ◽  
Minimum Size ◽  
Optimal Test ◽  
Test Set ◽  
Tree Structures ◽  
Ripple Carry Adder ◽  
Conflicting Objectives ◽  
Minimum Number ◽  
Test Sets ◽  
And Performance

On-the-fly calculations of area and performance are a typical part of the computer-aided iterative design process in VLSI, which aims at a satisfactory tradeoff of various conflicting objectives, among which are test-generation time and test-set size. However, determining test sets on-the-fly as one circuit is transformed into another is extremely difficult. Our goal is to add a test dimension to the design optimization process that complements methods concerned with area and performance optimization. We define a set of logic transformations that result in easily computed changes to test sets. Test-set preserving (TSP) transformations preserve a combinational circuit’s test sets, while test-set altering (TSA) transformations introduce a minimum number of tests needed to maintain completeness. We illustrate our approach with a family of adders that share area-efficient tree structures and differ in the amount of carry-lookahead used to accelerate carry computation. Members include the ripple-carry adder, which has no lookahead, and the standard carry-lookahead adder, which exploits lookahead across all inputs. It is straightforward to derive area and performance measures for this class of adders. Given an n-bit adder with lookahead degree k, we determine a sequence of circuit transformations that produce the adder of degree k2 and test sets of minimum size. Optimal test sets of size k(logkn + 1) + 2 result for arbitrary n and k, which improve significantly upon previously reported tests.

scholarly journals Covering Partial Cubes with Zones

10.37236/5076 ◽  
2015 ◽  
Vol 22 (3) ◽  
Author(s):  
Jean Cardinal ◽  
Stefan Felsner
Keyword(s):  
Isometric Embedding ◽  
Linear Extension ◽  
Upper And Lower Bounds ◽  
Minimum Size ◽  
Worst Case ◽  
Line Arrangement ◽  
Minimal Dimension ◽  
Special Cases ◽  
Minimum Number ◽  
Partial Cube

A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension of a hypercube in which the graph can be embedded. We consider the problem of covering the vertices of a partial cube with the minimum number of zones. The problem admits several special cases, among which are the following:cover the cells of a line arrangement with a minimum number of lines,select a smallest subset of edges in a graph such that for every acyclic orientation, there exists a selected edge that can be flipped without creating a cycle,find a smallest set of incomparable pairs of elements in a poset such that in every linear extension, at least one such pair is consecutive,find a minimum-size fibre in a bipartite poset.We give upper and lower bounds on the worst-case minimum size of a covering by zones in several of those cases. We also consider the computational complexity of those problems, and establish some hardness results.

scholarly journals Minimum survivable graphs with bounded distance increase

2003 ◽  
Vol Vol. 6 no. 1 ◽  
Author(s):  
Selma Djelloul ◽  
Mekkia Kouider
Keyword(s):  
Fault Tolerance ◽  
Lower Bounds ◽  
Interconnection Networks ◽  
Negative Integer ◽  
Upper And Lower Bounds ◽  
Minimum Size ◽  
Np Hard ◽  
Bounded Distance ◽  
Minimum Number ◽  
International Audience

International audience We study in graphs properties related to fault-tolerance in case a node fails. A graph G is k-self-repairing, where k is a non-negative integer, if after the removal of any vertex no distance in the surviving graph increases by more than k. In the design of interconnection networks such graphs guarantee good fault-tolerance properties. We give upper and lower bounds on the minimum number of edges of a k-self-repairing graph for prescribed k and n, where n is the order of the graph. We prove that the problem of finding, in a k-self-repairing graph, a spanning k-self-repairing subgraph of minimum size is NP-Hard.

scholarly journals Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size

10.37236/1055 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Ronald Gould ◽  
Tomasz Łuczak ◽  
John Schmitt
Keyword(s):  
Upper Bounds ◽  
Minimum Size ◽  
Saturated Graphs ◽  
Minimum Number

A graph $G$ is said to be $C_l$-saturated if $G$ contains no cycle of length $l$, but for any edge in the complement of $G$ the graph $G+e$ does contain a cycle of length $l$. The minimum number of edges of a $C_l$-saturated graph was shown by Barefoot et al. to be between $n+c_1{n\over l}$ and $n+c_2{n\over l}$ for some positive constants $c_1$ and $c_2$. This confirmed a conjecture of Bollobás. Here we improve the value of $c_2$ for $l \geq 8$.

scholarly journals THE PROBLEM OF EMPLACEMENT OF TRIANGULAR GEOMETRIC NET ON THE SPHERE WITH NODES ON THE SAME LEVEL

2017 ◽  
Vol 13 (2) ◽  
pp. 154-160 ◽  
Author(s):  
Vasilij D. Antoshkin
Keyword(s):  
Spherical Triangle ◽  
Minimum Size ◽  
Effective Solution ◽  
Shortest Distance ◽  
Minimum Number ◽  
Triangular Network ◽  
Spherical Triangles

One of the methods of formation of triangular networks in the field is investigated. Conditions of the problem of locating a triangular network in the area are delivered. The criterion for assessing the effectiveness of the solution of the problem is the minimum number of sizes of the dome panels, the possibility of pre-assembly and pre-stressing. The solution of the problem of one embodiment of a triangular network of accommodation in a compatible spherical triangle and, accordingly, on the sphere. Placing on the area of regular and irregular hexagon inscribed in a circle, ie, flat figures or composed in turn of spherical triangles with minimum dimensions of the ribs, is an effective solution in the form of a network formed by circles of minimum radii, ie, circles on a sphere obtained at the touch of three adjacent circles whose centers are at the shortest distance from each other. Task align the supports at one level can be resolved by placement in the regular hexagons and irregular pentagons hexagonsinscribed in a circle of minimum size.

Sign in / Sign up

Export Citation Format

Share Document