RO EN
On graphs G of diameter two with f(G)J|V(G)|+D-d+1
Authors: A. Postaru
– 0.16 Mb
Abstract
It is known that for any graph G there exists a graph H whose median is isomorphic to G: Med H @ G. For any graph G, let f(G) denote the minimal number of vertices of a connected graph H satisfying Med H @ G. It is known that if G of diameter two has n vertices and minimal (maximal) degree d(D) then f(G) і n+D-d. We constructed a wide class of graphs G of diameter two for which f(G) Ј n+D-d+1.Andrei Postaru,
Department of
Mathematics and Cybernetics,
Moldova State University,
60, Mateevici str., Kishinev,
Moldova
Department of
Mathematics and Cybernetics,
Moldova State University,
60, Mateevici str., Kishinev,
Moldova
Fulltext
– 0.16 Mb
Contents
- On program correctness and teaching programming
- On graphs G of diameter two with f(G)J|V(G)|+D-d+1
- On the architecture of problem-oriented simulation systems
- SimW - software for automatic creation of problem-oriented simulation systems
- Two problems concerning dynamic flows in node and arc capacitated networks
- The study of data and control flows and the user's interface organization in an applied system for chemistry and medicine
- A method of Romanian Lexicon compression
- Design of the Sequential System Automata using Temporal Equivalence Classes
- Grammar flow analysis reduction to scheduling problem
