Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions [PDF]
Networks, 2011 AbstractThe 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. For many interconnection networks, the optimal sets are precisely those induced by a single vertex.
Eddie Cheng 0001 +3 more
openaire +4 more sources
Matching preclusion and conditional matching preclusion for hierarchical cubic networks
AIMS Mathematics, 2022 <abstract><p>Matching preclusion originates from the measurement of interconnection network robustness in the event of edge failure. Conditional matching preclusion belongs to generalized matching preclusion. We obtain the matching preclusion number and conditional matching preclusion number for hierarchical cubic network($ HCN_n ...
Jinyu Zou, Haizhen Ren
openaire +3 more sources
Conditional K-Matching Preclusion for N-Dimensionaltorus Networks
Discrete Applied Mathematics, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaomin Hu, Xiangyu Ren, Weihua Yang
+6 more sources
Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper‐stars [PDF]
Networks, 2011 AbstractThe matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex.
Eddie Cheng 0001 +3 more
openaire +4 more sources
Conditional matching preclusion for the arrangement graphs
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eddie Cheng 0001 +3 more
openaire +2 more sources
Matching Preclusion and Conditional Matching Preclusion of Exchanged Crossed Cube
SSRN Electronic Journal, 2022 Bo Zhu, Shumin Zhang, Chengfu Ye
openaire +2 more sources
Super edge-connectivity and matching preclusion of data center networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Edge-connectivity is a classic measure for reliability of a network in the presence of edge failures. $k$-restricted edge-connectivity is one of the refined indicators for fault tolerance of large networks.
Huazhong Lü, Tingzeng Wu
doaj +1 more source
Generalized Matching Preclusion in Bipartite Graphs
Theory and Applications of Graphs, 2018 The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal such sets are precisely sets of edges
Zachary Wheeler +4 more
doaj +1 more source
3D Printing Innovations in Polymeric Porous and Patterned Architecture
Advanced Functional Materials, EarlyView.Polymeric foams occupy a unique structural space between dense solids and open networks, where engineered void fraction governs mechanical compliance, thermal resistance, and mass transport. Additive manufacturing now enables precise spatial control over cellular architecture, unlocking designer foam structures across applications spanning crash ...
Dhanush Patil +13 more
wiley +1 more source
Grounding Large Language Models for Robot Task Planning Using Closed‐Loop State Feedback
Advanced Robotics Research, EarlyView.BrainBody‐Large Language Model (LLM) introduces a hierarchical, feedback‐driven planning framework where two LLMs coordinate high‐level reasoning and low‐level control for robotic tasks. By grounding decisions in real‐time state feedback, it reduces hallucinations and improves task reliability.
Vineet Bhat +4 more
wiley +1 more source