Results 41 to 50 of about 73 (73)
On the radius of neighborhood graphs
, 2016 The k-step graph G′k of a graph G has the same vertex set as G and two vertices are adjacent in G ′ k if and only if there exists a path of length k connecting them in G. The graph G ′ 2 is called the neighborhood graph of G.
Vetrík, Tomás, Mukwembi, Simon
core
Upper Bounds for the Domination Number of a Graph
, 1996 . This paper compares several upper bounds based on the degree sequence of a graph G for the domination number fl(G). In particular, we show that the domination number of a graph G with n vertices and minimum degree ffi is at most (1 \Gamma S ffi )n ...
Boris Shekhtman +3 more
core
Game Chromatic Number of Graphs
, 1998 We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic ...
Xuding Zhu, Thomas Dinski
core
Decomposition of bounded degree graphs into C4-free subgraphs
We prove that every graph with maximum degree ∆ admits a partition of its edges into O(√∆) parts (as ∆→∞) none of which contains C4 as a subgraph. This bound is sharp up to a constantfactor. Our proof uses an iterated random colouring procedure.Keywords:
Kang, Ross, Perarnau Llobet, Guillem
core
Isoperimetric Inequalities and Eigenvalues
, 1997 An upper bound is given on the minimum distance between i subsets of same size of a regular graph in terms of the i-th largest eigenvalue in absolute value.
Nabil Kahale
core
Non-proper edge-colouring of graphs and hereditary graph properties
, 2017 A graph property is any isomorphism-closed class of graphs. A property P is hereditary if, whenever a graph G is in P, and H is a subgraph of G, then H is also in P.
Maritz, Elizabeth C.M. +3 more
core
Dominating Sets Whose Closed Stars Form Spanning Trees
, 1995 For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W .
Jerrold W. Grossman
core
Optimal cubic Lagrange interpolation: Extremal node systems with minimal Lebesgue constant
, 2015 In the theory of interpolation of continuous functions by algebraic polynomials of degree at most n − 1 > 2, the search for explicit analytic expressions of extremal node systems which lead to the minimal Lebesgue constant is still an intriguing topic in
RACK, Heinz-Joachim, VAJDA, Robert
core
Едно неравенство за обобщени хроматични графи
, 2012 Асен Божилов, Недялко Ненов - Нека G е n-върхов граф и редицата от степените на върховете му е d1, d2, . . . , dn, а V(G) е множеството от върховете на G. Степента на върха v бележим с d(v). Най-малкото естествено число r, за което V(G) има r-разлагане V(
Bojilov, Asen, Nenov, Nedyalko
core
Inducibility of topological trees
, 2019 Trees without vertices of degree 2 are sometimes named topological trees. In this work, we bring forward the study of the inducibility of (rooted) topological trees with a given number of leaves.
Dossou-Olory, Audace A.V. +1 more
core