Results 31 to 40 of about 217,204 (287)

Restricted Size Ramsey Number Involving Matching and Graph of Order Five

open access: yesJournal of Mathematical and Fundamental Sciences, 2020
Harary and Miller (1983) started the research on the (restricted) size Ramsey number for a pair of small graphs. They obtained the values for some pairs of small graphs with order not more than four.
Denny Riama Silaban   +2 more
doaj   +1 more source

The locating-chromatic number for Halin graphs

open access: yesCommunications in Combinatorics and Optimization, 2017
Let $G$ be a connected graph‎. ‎Let $f$ be a proper $k$-coloring of $G$ and $\Pi=\{R_1,R_2,\ldots‎, ‎R_k\}$ be an ordered partition of $V(G)$ into color classes‎. ‎For any vertex $v$ of $G,$ define the {\em color code} $c_\Pi(v)$ of $v$ with respect to $\
I.A‎. ‎Purwasih   +4 more
doaj   +1 more source

Machine learning‐based scheduling: a bibliometric perspective

open access: yesIET Collaborative Intelligent Manufacturing, 2021
In recent years, the rapid development of artificial intelligence and data science has given rise to the study of data driven algorithms in highly volatile systems. The scheduling of complex shop floor resources falls into such a category, which is often
Shiyun Li   +6 more
doaj   +1 more source

The power of microRNA regulation—insights into immunity and metabolism

open access: yesFEBS Letters, EarlyView.
MicroRNAs are emerging as crucial regulators at the intersection of metabolism and immunity. This review examines how miRNAs coordinate glucose and lipid metabolism while simultaneously modulating T‐cell development and immune responses. Moreover, it highlights how cutting‐edge artificial intelligence applications can identify miRNA biomarkers ...
Stefania Oliveto   +2 more
wiley   +1 more source

On distance labelings of 2-regular graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2021
Let G  be a graph with |V(G)| vertices and ψ :  V(G) → {1, 2, 3, ... , |V(G)|} be a bijective function. The weight of a vertex v ∈ V(G) under ψ is wψ(v) = ∑u ∈ N(v)ψ(u).  The function ψ is called a distance magic labeling of G, if wψ(v) is a constant for
Anak Agung Gede Ngurah   +1 more
doaj   +1 more source

Understanding and measuring mechanical signals in the tumor stroma

open access: yesFEBS Open Bio, EarlyView.
This review discusses cancer‐associated fibroblast subtypes and their functions, particularly in relation to extracellular matrix production, as well as the development of 3D models to study tumor stroma mechanics in vitro. Several quantitative techniques to measure tissue mechanical properties are also described, to emphasize the diagnostic and ...
Fàtima de la Jara Ortiz   +3 more
wiley   +1 more source

Beyond digital twins: the role of foundation models in enhancing the interpretability of multiomics modalities in precision medicine

open access: yesFEBS Open Bio, EarlyView.
This review highlights how foundation models enhance predictive healthcare by integrating advanced digital twin modeling with multiomics and biomedical data. This approach supports disease management, risk assessment, and personalized medicine, with the goal of optimizing health outcomes through adaptive, interpretable digital simulations, accessible ...
Sakhaa Alsaedi   +2 more
wiley   +1 more source

Combinatorial identities for binary necklaces from exact ray-splitting trace formulae [PDF]

open access: yes, 2001
Based on an exact trace formula for a one-dimensional ray-splitting system, we derive novel combinatorial identities for cyclic binary sequences (P\'olya necklaces).
arxiv   +1 more source

Combinatorial geometries of field extensions [PDF]

open access: yesBulletin of the London Mathematical Society, 40 (2008), no. 5, 789--800, 2009
We classify the algebraic combinatorial geometries of arbitrary field extensions of transcendence degree greater than 4 and describe their groups of automorphisms. Our results and proofs extend similar results and proofs by Evans and Hrushovski in the case of algebraically closed fields.
arxiv   +1 more source

La recherche d’un fondement absolu des mathématiques par l’Ecole combinatoire de C. F. Hindenburg (1741-1808)

open access: yesPhilosophia Scientiæ, 2005
Carl Friedrich Hindenburg (1741-1808), founder of the “so-called Combinatorial School” (Eugen Netto), had been forgotten until recently. However, an article about him can be found in the Dictionary of Scientific Biography.
Philippe Séguin
doaj   +1 more source

Home - About - Disclaimer - Privacy