По вашему запросу найдено документов: 2531
Страница 1 из 254
On the doubly connected domination polynomial of a graph© 2019 World Scientific Publishing Company Let (Formula presented.) be a simple graph. A set
Embeddings of *-graphs into 2-surfacesThis paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question
Some results on prime labelings of graphsThe purpose of this paper is to give some new families of graphs that have a prime labeling
Some results on prime labelings of graphsThe purpose of this paper is to give some new families of graphs that have a prime labeling
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
Generating Graphs With Specified Properties And Their Use For Constructing Scene Graphs From ImagesGraph generation, the process of creating
meaningful graphs, plays a vital role
The Number of 2-dominating Sets, and 2-domination Polynomial of a GraphAbstract: Let $$G=(V,E)$$ be a simple graph. A set $$D\subseteq V$$ is a $$2$$-dominating set
A Glazman–Povzner–Wienholtz theorem on graphs to Schrödinger operators on graphs. We first obtain the corresponding theorem for Schrödinger operators on metric
Towards Time-Optimal Any-Angle Path Planning With Dynamic ObstaclesPath finding is a well-studied problem in AI, which is often framed as graph search. Any-angle path
Extensions and small subgraphs in a random distance graph of random distance graphs. Previously, threshold probabilities for the properties of containing a fixed
Страница 1 из 254
Фасеты
Партнеры
Индексация
