Results 41 to 50 of about 2,372,931 (298)

Vertex Cover Hop Dominating Sets in Graphs

open access: yesEuropean Journal of Pure and Applied Mathematics
Let $G$ be a graph. Then a subset $C$ of vertices of $G$ is called a vertex cover hop dominating if $C$ is both a vertex cover and a hop dominating of $G$.
Vergel T. Bilar   +3 more
semanticscholar   +1 more source

Weakly Completely Prime Graph

open access: yesWasit Journal for Pure Sciences, 2023
     In this paper, we presented a new properties of a weakly completely prime graph, where we added the algebraic properties in this graph and extracted from them some important theories and results, with the study of homomorphism in this graph when ...
ameer al-swidi, Ahmed A.Omran
doaj   +1 more source

Some Graph Polynomials of the Power Graph and its Supergraphs [PDF]

open access: yesMathematics Interdisciplinary Research, 2020
‎In this paper‎, ‎exact formulas for the dependence‎, ‎independence‎, ‎vertex cover and clique polynomials of the power graph and its‎ ‎supergraphs for certain finite groups are presented‎.
Asma Hamzeh
doaj   +1 more source

An Optimized Topology Discovery Mechanism in Software Defined Networks

open access: yesJournal of Harbin University of Science and Technology, 2022
Aiming at the problems of excessive resource consumption and low operating efficiency in the topology discovery mechanism in Software Defined Networks (SDN), a stronger topology discovery mechanism (S-OFDP) is proposed.
LI Lan-ying, WANG Min, ZHU Su-xia
doaj   +1 more source

Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover [PDF]

open access: yesACM-SIAM Symposium on Discrete Algorithms, 2020
We study the generalized min sum set cover (GMSSC) problem, wherein given a collection of hyperedges $E$ with arbitrary covering requirements $k_e$, the goal is to find an ordering of the vertices to minimize the total cover time of the hyperedges; a ...
N. Bansal   +3 more
semanticscholar   +1 more source

FGFR Like1 drives esophageal cancer progression via EMT, PI3K/Akt, and notch signalling: insights from clinical data and next‐generation sequencing analysis

open access: yesFEBS Open Bio, EarlyView.
Clinical analysis reveals significant dysregulation of FGFRL1 in esophageal cancer (EC) patients. RNAi‐coupled next‐generation sequencing (NGS) and in vitro study reveal FGFRL1‐mediated EC progression via EMT, PI3K/Akt, and Notch pathways. Functional assays confirm its role in tumor growth, migration, and invasion.
Aprajita Srivastava   +3 more
wiley   +1 more source

Reducing the rank of a matroid [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
We consider the rank reduction problem for matroids: Given a matroid $M$ and an integer $k$, find a minimum size subset of elements of $M$ whose removal reduces the rank of $M$ by at least $k$. When $M$ is a graphical matroid this problem is the minimum $
Gwenaël Joret, Adrian Vetta
doaj   +1 more source

Multi‐omics and low‐input proteomics profiling reveals dynamic regulation driving pluripotency initiation in early mouse embryos

open access: yesFEBS Open Bio, EarlyView.
Mouse pre‐implantation development involves a transition from totipotency to pluripotency. Integrating transcriptomics, epigenetic profiling, low‐input proteomics and functional assays, we show that eight‐cell embryos retain residual totipotency features, whereas cytoskeletal remodeling regulated by the ubiquitin‐proteasome system drives progression ...
Wanqiong Li   +8 more
wiley   +1 more source

Bistable Mechanisms 3D Printing for Mechanically Programmable Vibration Control

open access: yesAdvanced Engineering Materials, EarlyView.
This work introduces a 3D‐printed bistable mechanism integrated into tuned mass dampers (TMDs) for mechanically adaptive passive vibration suppression. Through optimized geometry, the bistable design provides adaptable vibration reduction across a broad range of scenarios, achieving effective vibration mitigation without complex controls or external ...
Ali Zolfagharian   +4 more
wiley   +1 more source

Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints

open access: yesAlgorithms
In this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs.
Yasuaki Kobayashi   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy