Results 11 to 20 of about 405,795 (217)
Completeness-Resolvable Graphs [PDF]
Graphs and Combinatorics, 2022 Given a connected graph $G=(V(G), E(G))$, the length of a shortest path from a vertex $u$ to a vertex $v$ is denoted by $d(u,v)$. For a proper subset $W$ of $V(G)$, let $m(W)$ be the maximum value of $d(u,v)$ as $u$ ranging over $W$ and $v$ ranging over $V(G)\setminus W$. The proper subset $W=\{w_1,\ldots,w_{|W|}\}$ is a {\em completeness-resolving set}
Min Feng, Xuanlong Ma, Huiling Xu
openaire +3 more sources
Computational graph completion
Research in the Mathematical Sciences, 2022 34 pages.
openaire +4 more sources
Isomorphic Factorisations. I: Complete Graphs [PDF]
Transactions of the American Mathematical Society, 1978 An isomorphic factorisation of the complete graphKp{K_p}is a partition of the lines ofKp{K_p}intotisomorphic spanning subgraphsG; we then writeG|KpG|{K_p}, andG∈Kp/tG \in {K_p}/t. If the set of graphsKp/t{K_p}/tis not empty, then of courset|p(p−1)/2t|p(p - 1)/2. Our principal purpose is to prove the converse.
Harary, Frank +2 more
openaire +2 more sources
Discussiones Mathematicae Graph Theory, 2021 Let G be either a complete graph of odd order or a complete bipartite graph in which each vertex partition has an even number of vertices. In this paper, we determine the set of triples (p, q, r), with p, q, r > 0, for which there exists a decomposition ...
Shyu Tay-Woei
doaj +1 more source
Avoider-enforcer star games [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Combinatorics
Andrzej Grzesik +5 more
doaj +1 more source
Character degree graphs that are complete graphs [PDF]
Proceedings of the American Mathematical Society, 2006 Let \(G\) be a finite group and let \(\text{cd}(G)\) denote the different integers which occur as the degrees of the irreducible complex characters of \(G\). Let \(\Gamma(G)\) be the graph whose vertex set is \(\text{cd}(G)-\{1\}\). An edge joins two vertices represented by positive integers \(a\) and \(b\) if \(\gcd(a,b)>1\). The authors prove that if
M. Bianchi +3 more
openaire +4 more sources
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2018 This study aims to determine the minimum spanning tree of a complete graph K_n with weight constraints and completion using the cutting plane method. The cutting plane method is one of the algorithms included in the exact method.
Dewi Suhika, Wamiliana Wamiliana
doaj +1 more source
Dynamics, 2023 Ramsey theory constitutes the dynamics of mechanical systems, which may be described as abstract complete graphs. We address a mechanical system which is completely interconnected by two kinds of ideal Hookean springs.
Nir Shvalb +3 more
doaj +1 more source
On the Semigroup Whose Elements Are Subgraphs of a Complete Graph
Mathematics, 2018 Let K n be a complete graph on n vertices. Denote by S K n the set of all subgraphs of K n . For each G , H ∈ S K n , the ring sum of G and H is a graph whose vertex set is V ( G ) ∪ V ( H ) and whose edges are ...
Yanisa Chaiya +3 more
doaj +1 more source
Edge-maximal -free non-bipartite Hamiltonian graphs of odd order
AKCE International Journal of Graphs and Combinatorics, 2022 Let [Formula: see text] denote the class of non-bipartite graphs on n vertices containing no [Formula: see text]-graph and [Formula: see text] Let [Formula: see text] denote the class of non-bipartite Hamiltonian graphs on n vertices containing no ...
M. M. M. Jaradat +4 more
doaj +1 more source