The interval number of a graph G, denoted by i(G), is the least natural number t such that G is the intersection graph of sets, each of which is the union of at most t intervals. Here we settle a conjecture of Griggs and West about bounding i(G) in terms of e, that is, the number of edges in G. Name
Comments on ‘The computation of wavelet-Galerkin approximation on a bounded interval’
✍ Scribed by Tonghua Zhang; Yu-Chu Tian; Moses O. Tadé; Johan Utomo
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 100 KB
- Volume
- 72
- Category
- Article
- ISSN
- 0029-5981
- DOI
- 10.1002/nme.2022
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The upper bound on the interval number of a graph in terms of its number of edges is improved. Also, the interval number of graphs in hereditary classes is bounded in terms of the vertex degrees. A representation of a graph as an intersection graph assigns each vertex a set such that vertices are a
Numerical simulation of industrial processes involving viscoelastic liquids is often based on finite element methods on quadrilateral meshes. However, numerical analysis of these methods has so far been limited to triangular meshes. In this work, we consider quadrilateral meshes. We first study the
## Abstract Verification of the computation of local quantities of interest, e.g. the displacements at a point, the stresses in a local area and the stress intensity factors at crack tips, plays an important role in improving the structural design for safety. In this paper, the smoothed finite elem