Results 61 to 70 of about 96,090 (258)
Star Bicolouring of Bipartite Graphs
We give an integer linear program formulation for the star bicolouring of bipartite graphs. We develop a column generation method to solve the linear programming relaxation to obtain a lower bound for the minimum number of colours needed.
Daya Gaur +2 more
doaj +1 more source
Complexity of Roman {2}-domination and the double Roman domination in graphs
For a simple, undirected graph a Roman {2}-dominating function (R2DF) has the property that for every vertex with f(v) = 0, either there exists a vertex with f(u) = 2, or at least two vertices with The weight of an R2DF is the sum The minimum weight of ...
Chakradhar Padamutham +1 more
doaj +1 more source
SKALE 2.0 maps disease‐associated protein aggregation as a phase‐resolved structural process, linking mutation‐induced geometric perturbations to nucleation, elongation, and suppressor design. Across neurodegenerative proteins, the framework reveals cryptic aggregation vulnerabilities, separates phase‐concordant and phase‐switching mutations, and ...
Jia Shen Sio +6 more
wiley +1 more source
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers.
Kalpana Mahalingam +1 more
doaj +1 more source
Robust Representation Learning for Clean Feature Discovery in Incomplete Multi‐View Clustering
Robust feature discovery in incomplete multi‐view clustering is achieved by coupling RPCA‐based clean representation recovery with neural‐network‐assisted graph learning. The resulting RIMVC framework constructs cleaner and more discriminative graph‐structured representations from incomplete and noisy multi‐view data, improving clustering robustness ...
Ping Hu +4 more
wiley +1 more source
This paper introduces the concept of filters in a rough bi-Heyting algebra. The rough bi-Heyting algebra defined through the rough semiring offers interesting properties.
Praba Bashyam +1 more
doaj +1 more source
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n,
Sakander Hayat, Asad Khan, Yubin Zhong
doaj +1 more source
RNA‐centric world of retroviruses: unravelling the molecular strategies of genomic RNA packaging
ABSTRACT Retroviruses constitute a unique group of RNA viruses that have profoundly influenced both evolutionary trajectories and biomedical research. Their ability to reverse transcribe and integrate into host genomes has shaped genomic architecture across species and contributed to our understanding of oncogenes, gene regulation, and RNA biology ...
Mohammad Abdullah Jehad +5 more
wiley +1 more source
Warm‐wet transition restructures arid lake microbiomes and functional potential
This study summarizes how a long‐term warm‐dry to warm‐wet transition restructures microbiomes and functional potential in Lake Bosten, an arid lake in northwestern China. Warm‐wet hydroclimatic change increased water level and hydrological connectivity, while decreasing salinity and total nitrogen.
Zhen Shen +8 more
wiley +1 more source
Topological Symmetry Groups of Complete Bipartite Graphs [PDF]
The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular abstract ...
Kathleen Hake, B. Mellor, Matt Pittluck
semanticscholar +1 more source

