Virtual crossing numbers for virtual knots crossing numbers and the arrow polynomial, in The Mathematics of Knots.
Theory and Applications, eds. M
On the doubly connected domination polynomial of a graph© 2019 World Scientific Publishing Company Let (Formula presented.) be a simple
graph. A set
From linear models of communications to network model - evolution and fusion communication, Kincaid convergence model, as
graph theory, network flow
theory and links analysis model were
Возможности применения теории графов для решения различных видов прикладных задачPossibilities of applying
graph theory to solving various types of applied problems
APPOINTMENT OF TEACHERS IN CLASSES WITH THE TECHNOLOGY TRAINING level has been formulated in the work. The constructed mathematical model based on the
Theory of
Graphs On Maximum Flow Problem Solution of the Signaling Network GraphThe maximum flow problem is formulated in terms of
graph theory for the signaling network of given
Some methods of solving the NP-difficult problem of optimal schedule for the university. Classical scheduling
theory includes only a narrow circle of well-formalized problems that are usually
Some results on prime labelings of graphsThe purpose of this paper is to give some new families of
graphs that have a prime labeling