По вашему запросу найдено документов: 308085
Страница 1 из 30809
О центре графа, определяемого подгруппами Шмидта конечной группы-nilpotent group whose proper subgroups are nilpotent. Schmidt graph of a finite group G is
the prime graph
О центре разрешимого графа некоторых простых неабелевых групп лиева типа graph associated with a finite group G is a simple graph whose vertices are the prime divisors of |G
Genetic algorithm of network graph multi-objective optimization as an instrument of project monitoring© 2015 Canadian Center of Science and Education. All rights reserved. Proper tracking of progress
Genetic algorithm of network graph multi-objective optimization as an instrument of project monitoring© 2015 Canadian Center of Science and Education. All rights reserved. Proper tracking of progress
On the doubly connected domination polynomial of a graph© 2019 World Scientific Publishing Company Let (Formula presented.) be a simple graph. A set
Automorphisms of distance regular graphsin which the neighborhoods of the verticesare strongly regular graphs: Reportof Philosophy Doctor Thesis: 01.01.06 — mathematical logic, algebra and theory ofnumbers regular graphs: Reportof Philosophy Doctor Thesis: 01.01.06 — mathematical logic, algebra and theory
Small subgraphs and their extensions in a random distance graph graphs are established. A result on the threshold function for the property of containing a fixed
Embeddings of *-graphs into 2-surfaces of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph
ПРОБЛЕМА ФОРМИРОВАНИЯ СОДЕРЖАНИЯ ИНТЕГРИРОВАННЫХ ЕСТЕСТВЕННОНАУЧНЫХ КУРСОВ ДЛЯ СТУДЕНТОВ-ГУМАНИТАРИЕВ grounds: a single object of study of all natural sciences is nature, and a tool for its cognition
Some results on prime labelings of graphsThe purpose of this paper is to give some new families of graphs that have a prime labeling
Страница 1 из 30809
Фасеты
Партнеры
Индексация
