Results 71 to 80 of about 11,648,998 (193)
Mutual-visibility problems in Kneser and Johnson graphs [PDF]
Let $G$ be a connected graph and $\cal X \subseteq V(G)$. By definition, two vertices $u$ and $v$ are $\cal X$-visible in $G$ if there exists a shortest $u,v$-path with all internal vertices being outside of the set $\cal X$. The largest size of $\cal X$
Bujtás, Csilla +1 more
core +2 more sources
The Coloring of Square of Subgraphs of Kneser Graphs
, 2007 本文所討論的圖形均為簡單圖，即頂點個數有限多個、邊的端點不一樣、邊沒有方向、以及兩個頂點之間最多只有一個邊。 Kneser圖KG(n, k)的點集為集合[N]＝{1,2,3,…,n}中大小為k的所有子集，兩個點有邊相連若且為若這兩個集合互斥。一個圖G的平方記為G2，圖G2是由圖G的點所生成：在圖G中相異兩點的距離不大於2的點都給個邊相連。在第二節中我們證明，當k>2時，圖KG2(2k+1, k)的著色數可以從 已知的4k+2降為3k+2。緊緻Kneser圖KG2(n, k)是Kneser圖KG(n,
陳俊佑, Chen, Jun-Yo
core
, 2001 Some problems by the analysis of the dynamic of mechanical systems lead on the solution of nonlinear integrodifferential equations.
Hortel, Milan
core
Hamiltonian cycles in Kneser graphs [PDF]
, 2017 In this thesis, we will discuss existence of hamiltonian cycles in Kneser graphs: graphs K(n,k) with vertex set corresponding to k-element subsets from set of n elements, and vertices will be adjacent if and only if their corresponding k-sets are ...
Hulcová, Tereza
core
Treewidth of the Kneser graph and the Erdős-Ko-Rado Theorem [PDF]
, 2014 Treewidth is an important and well-known graph parameter that measures the complexity of a graph. The Kneser graph Kneser(n, k) is the graph with vertex set ([n]k), such that two vertices are adjacent if they are disjoint.
Wood, David; id_orcid, Harvey, Daniel
core +3 more sources
Dominating sets in Kneser graphs [PDF]
, 2007 This thesis investigates dominating sets in Kneser graphs as well as a selection of other topics related to graph domination. Dominating sets in Kneser graphs, especially those of minimum size, often correspond to interesting combinatorial incidence ...
Gorodezky, Igor
core
Equitable coloring of Kneser graphs [PDF]
, 2009 The Kneser graph K(n,k) is the graph whose vertices correspond to k-element subsets of set {1,2,...,n} and two vertices are adjacent if and only if they represent disjoint subsets. In this paper we study the problem of equitable coloring of Kneser graphs,
Żyliński, Paweł +2 more
core +1 more source
, 2017 Let $k,d,\lambda\ge 1$ be integers with $d\ge \lambda $. Let $m(k,d,\lambda)$ be the maximum positive integer $n$ such that every set $X$ of $n$ points (not necessarily in general position) in $\mathbb{R}^{d}$ has the property that the convex hulls of ...
Ramirez Alfonsin, Jorge
core +1 more source
Normothermic Ex Situ Machine Perfusion of Vascularized Composite Allografts with Oxygen Microcarriers for 12 Hours Using Real-Time Mitochondrial Redox Quantification. [PDF]
J Clin Med, 2023 Haug V +8 more
europepmc +1 more source
Microporous Polylactic Acid Scaffolds Enable Fluorescence-Based Perfusion Imaging of Intrinsic In Vivo Vascularization. [PDF]
Int J Mol Sci, 2023 Koepple C +6 more
europepmc +1 more source