Results 31 to 40 of about 3,369,792 (260)
Minimizing the oriented diameter of a planar graph [PDF]
, 2009 We consider the problem of minimizing the diameter of an orientation of a planar graph. A result of Chvátal and Thomassen shows that for general graphs, it is NP-complete to decide whether a graph can be oriented so that its diameter is at most two.
Noble, SD +3 more
core +1 more source
On dynamic colouring of cartesian product of complete graph with some graphs
Journal of Taibah University for Science, 2020 A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj +2 more
doaj +1 more source
The Coloring Graph of Complete Graphs
The PUMP Journal of Undergraduate Research, 2019 We study the coloring graph of the family of complete graphs and we prove that Cn(Kt) is regular, transitive, and connected when n>t. Also, we study whether Cn(Kt) is distance transitive or strongly regular, and find its diameter.
openaire +2 more sources
The Thickness of the Complete Graph [PDF]
Canadian Journal of Mathematics, 1965 A graph G consists of a finite set of p points and q lines joining pairs of these points. Each line joins two distinct points and no pair of points is joined by more than one line. A subgraph of G is a graph whose points and lines are also in G. If every pair of points of a graph is joined by a line, the graph is called complete and is denoted by Kp. A
Beineke, L. W., Harary, Frank
openaire +2 more sources
The t-Pebbling Number of Jahangir Graph [PDF]
, 2012 Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move (or pebbling step) is defined as the removal of two pebbles from a vertex and placing one pebble on an adjacent vertex.
Samuel Jeyaseelan, S. +2 more
core +1 more source
Packing four copies of a tree into a complete bipartite graph [PDF]
, 2022 summary:In considering packing three copies of a tree into a complete bipartite graph, H. Wang (2009) gives a conjecture: For each tree $T$ of order $n$ and each integer $k\geq 2$, there is a $k$-packing of $T$ in a complete bipartite graph $B_{n+k-1 ...
Pu, Liqun, Gao, Xiaoli, Tang, Yuan
core +1 more source
Decomposition of the completer-graph into completer-partiter-graphs
Graphs and Combinatorics, 1986 Let \(K_ r(n)\) be a complete r-partite hypergraph with n vertices. By \(f_ r(n)\) is denoted the minimal number q of pairwise edge-disjoint r- partite complete r-uniform hypergraphs which cover all edges of \(K_ r(n).\) In the paper is given an asymptotic value of the \(f_ r(n)\). For every fixed \(r\geq 1\) exist two positive numbers \(c_ 1(r)\) and \
openaire +2 more sources
The distance magic property and two families of Cartesian product graphs
Electronic Journal of Graph Theory and ApplicationsLet G = G(V, E) be a simple graph. The graph G is said to be distance magic if there exists a bijection f : V → {1, 2, …, |V|} and a constant s such that Σy ∈ N(x)f(y)=s for all x ∈ V.
Patrick Thomas Headley
doaj +1 more source
Avoider-enforcer star games [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Combinatorics
Andrzej Grzesik +5 more
doaj +1 more source
CoRR, 2014 The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem under the standard low rank assumption is NP-hard, Candès and Recht showed that it can be exactly relaxed if the number of observed entries is sufficiently large.
Vassilis Kalofolias +3 more
openaire +3 more sources