Results 51 to 60 of about 90,789 (282)
Lower bounds on the signed (total) $k$-domination number depending on the clique number
Communications in Combinatorics and Optimization, 2018 Let $G$ be a graph with vertex set $V(G)$. For any integer $k\ge 1$, a signed (total) $k$-dominating function is a function $f: V(G) \rightarrow \{ -1, 1\}$ satisfying $\sum_{x\in N[v]}f(x)\ge k$ ($\sum_{x\in N(v)}f(x)\ge k$) for every $v ...
L. Volkmann
doaj +1 more source
On the structure of (pan, even hole)-free graphs
, 2017 A hole is a chordless cycle with at least four vertices. A pan is a graph which consists of a hole and a single vertex with precisely one neighbor on the hole. An even hole is a hole with an even number of vertices.
Aboulker +33 more
core +1 more source
MusicSwarm: Biologically Inspired Intelligence for Music Composition
Advanced Intelligent Systems, EarlyView.Biologically inspired swarms of frozen foundation models self‐organize to compose complex music without fine‐tuning. By coordinating through stigmergic signals, decentralized agents dynamically evolve specialized roles and adapt to solve complex tasks.
Markus J. Buehler
wiley +1 more source
Perfect graphs of arbitrarily large clique-chromatic number
, 2015 We prove that there exist perfect graphs of arbitrarily large clique-chromatic number. These graphs can be obtained from cobipartite graphs by repeatedly gluing along cliques. This negatively answers a question raised by Duffus, Sands, Sauer, and Woodrow
Charbit, Pierre +3 more
core +3 more sources
On oriented relative clique number
Electronic Notes in Discrete Mathematics, 2015 An oriented graph is a directed graph with no cycle of length one or two. The relative clique number of an oriented graph is the order of a largest subset X of vertices such that each pair of vertices are either adjacent or connected by a directed 2-path. It is known that the oriented relative clique number of a planar graph is at most 80.
Sandip Das, Swathyprabhu Mj, Sagnik Sen
openaire +1 more source
Quantitative proteomics identifies clusterin as a novel biomarker for atherosclerosis
Animal Models and Experimental Medicine, EarlyView.This schematic illustrates the proposed mechanism. In advanced atherosclerotic lesions, upregulated CLU on the cell surface activates low‐density lipoprotein (LDL) receptor‐related protein 1 (LRP1). This interaction triggers the phosphorylation and activation of AKT.
Dengfeng Ding +10 more
wiley +1 more source
, 2018 Given an integer $k \geq 2$ and a real number $\gamma\in [0, 1]$, which graphs of edge density $\gamma$ contain the largest number of $k$-edge stars?
Reiher, Christian, Wagner, Stephan
core +1 more source
Forcing clique immersions through chromatic number [PDF]
Electronic Notes in Discrete Mathematics, 2016 Building on recent work of Dvo k and Yepremyan, we show that every simple graph of minimum degree $7t+7$ contains $K_t$ as an immersion and that every graph with chromatic number at least $3.54t + 4$ contains $K_t$ as an immersion. We also show that every graph on $n$ vertices with no stable set of size three contains $K_{2\lfloor n/5 \rfloor}$ as ...
Gauthier G., Le T. -N., Wollan P.
openaire +4 more sources
Detecting cryptic ghost lineage introgression in four‐taxon genomic datasets
Applications in Plant Sciences, EarlyView.Abstract Premise Hybridization and introgression are pervasive evolutionary forces that have played fundamental roles in shaping the diversity of wild and domesticated plants. Four‐taxon tests for introgression provide a reliable framework for detecting signatures of ancient introgression from genomic data, which have played an important role in ...
Evan S. Forsythe +3 more
wiley +1 more source
Distance signless Laplacian eigenvalues, diameter, and clique number [PDF]
Discrete Mathematics Letters, 2022 Saleem Khan, Shariefuddin Pirzada
doaj +1 more source