Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 7

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  degree
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

On the Schauder fixed point theorem

100%
EN
The paper contains a survey of various results concerning the Schauder Fixed Point Theorem for metric spaces both in single-valued and multi-valued cases. A number of open problems is formulated.
2
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

On the second largest eigenvalue of a mixed graph

100%
EN
Let G be a mixed graph. We discuss the relation between the second largest eigenvalue λ₂(G) and the second largest degree d₂(G), and present a sufficient condition for λ₂(G) ≥ d₂(G).
3
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Minimal vertex degree sum of a 3-path in plane maps

88%
EN
Let wₖ be the minimum degree sum of a path on k vertices in a graph. We prove for normal plane maps that: (1) if w₂ = 6, then w₃ may be arbitrarily big, (2) if w₂ < 6, then either w₃ ≤ 18 or there is a ≤ 15-vertex adjacent to two 3-vertices, and (3) if w₂ < 7, then w₃ ≤ 17.
4
Content available remote

The Degree-Diameter Problem for Outerplanar Graphs

75%
EN
For positive integers Δ and D we define nΔ,D to be the largest number of vertices in an outerplanar graph of given maximum degree Δ and diameter D. We prove that [...] nΔ,D=ΔD2+O (ΔD2−1) $n_{\Delta ,D} = \Delta ^{{D \over 2}} + O\left( {\Delta ^{{D \over 2} - 1} } \right)$ is even, and [...] nΔ,D=3ΔD−12+O (ΔD−12−1) $n_{\Delta ,D} = 3\Delta ^{{{D - 1} \over 2}} + O\left( {\Delta ^{{{D - 1} \over 2} - 1} } \right)$ if D is odd. We then extend our result to maximal outerplanar graphs by showing that the maximum number of vertices in a maximal outerplanar graph of maximum degree Δ and diameter D asymptotically equals nΔ,D.
5
Content available remote

Equivariant Nielsen theory

75%
6
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Some applications of pq-groups in graph theory

75%
EN
We describe some new applications of nonabelian pq-groups to construction problems in Graph Theory. The constructions include the smallest known trivalent graph of girth 17, the smallest known regular graphs of girth five for several degrees, along with four edge colorings of complete graphs that improve lower bounds on classical Ramsey numbers.
7
Content available remote

Open maps between Knaster continua

75%
EN
We investigate the set of open maps from one Knaster continuum to another. A structure theorem for the semigroup of open induced maps on a Knaster continuum is obtained. Homeomorphisms which are not induced are constructed, and it is shown that the induced open maps are dense in the space of open maps between two Knaster continua. Results about the structure of the semigroup of open maps on a Knaster continuum are obtained and two questions about the structure are posed.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.