Results 71 to 80 of about 163 (126)
Optimal cubic Lagrange interpolation: Extremal node systems with minimal Lebesgue constant [PDF]
, 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
Inverse Problem on the Steiner Wiener Index
Discussiones Mathematicae Graph Theory, 2018 The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) =∑u,v∈V (G)dG(u, v), where dG(u, v) is the distance (the length a shortest path) between the vertices u and v in G. For S ⊆ V (G), the Steiner distance d(S) of
Li Xueliang, Mao Yaping, Gutman Ivan
doaj +1 more source
More Results on The Smallest One-Realization of A Given Set II
Discussiones Mathematicae Graph Theory, 2019 Let S be a finite set of positive integers. A mixed hypergraph ℋ is a onerealization of S if its feasible set is S and each entry of its chromatic spectrum is either 0 or 1.
Diao Kefeng, Lu Fuliang, Zhao Ping
doaj +1 more source
Conflict-free coloring of graphs
, 2013 We study the conflict-free chromatic number χCF of graphs from ex-tremal and probabilistic point of view. We resolve a question of Pach and Tardos about the maximum conflict-free chromatic number an n-vertex graph can have. Our construction is randomized.
Tibor Szabó +2 more
core
On the δ-chromatic numbers of the Cartesian products of graphs
Open MathematicsIn this work, we study the δ\delta -chromatic number of a graph, which is the chromatic number of the δ\delta -complement of a graph. We give a structure of the δ\delta -complements and sharp bounds on the δ\delta -chromatic numbers of the Cartesian ...
Tangjai Wipawee +2 more
doaj +1 more source
Kolmogorov Random Graphs And The Incompressibility Method
, 1997 . We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method.
John Tromp +3 more
core
Maximum Edge-Colorings Of Graphs
Discussiones Mathematicae Graph Theory, 2016 An r-maximum k-edge-coloring of G is a k-edge-coloring of G having a property that for every vertex v of degree dG(v) = d, d ≥ r, the maximum color, that is present at vertex v, occurs at v exactly r times. The r-maximum index χr′(G)$\chi _r^\prime (G)$
Jendrol’ Stanislav +1 more
doaj +1 more source
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
The Minimum Harmonic Index for Unicyclic Graphs with Given Diameter
Discussiones Mathematicae Graph Theory, 2018 The harmonic index of a graph G is defined as the sum of the weights 2d(u)+d(v)${2 \over {d(u) + d(v)}}$ of all edges uv of G, where d(u) denotes the degree of a vertex u in G.
Zhong Lingping
doaj +1 more source
Spectral Radius and Hamiltonicity of Graphs
Discussiones Mathematicae Graph Theory, 2019 In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or its complement,
Yu Guidong +3 more
doaj +1 more source