๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Majorants and minorants for the classes of graphs with fixed diameter and number of vertices

โœ Scribed by T. I. Fedoryaeva

Book ID
120950299
Publisher
Pleiades Publishing
Year
2013
Tongue
English
Weight
598 KB
Volume
7
Category
Article
ISSN
1990-4789

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Graphs with given odd sets and the least
Graphs with given odd sets and the least number of vertices
โœ Louis Hakimi, S. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 64 KB ๐Ÿ‘ 2 views

This note presents a solution to the following problem posed by Chen, Schelp, and Soltรฉs: find a simple graph with the least number of vertices for which only the degrees of the vertices that appear an odd number of times are given.

On a Class of Polynomials and Its Relati
On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs
โœ M.A. Fiol; E. Garriga; J.L.A. Yebra ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 602 KB

Let \* 1 >\* 2 > } } } >\* d be points on the real line. For every k=1, 2, ..., d, the k-alternating polynomial P k is the polynomial of degree k and norm Because of this optimality property, these polynomials may be thought of as the discrete version of the Chebychev polynomials T k and, for parti