One of the possibilities when modelling a transport network is to use a graph with vertices and edges. They
represent the nodes and arcs of such a network respectively. There are dozens of parameters or characteristics
that we can describe in graphs, including the different types of domination number and the problems related
to it. The main aim of this paper has been to show the possibilities of the application of the selected domination-
oriented concepts to modelling and improving the transportation and/or logistics networks. Firstly,
the basic description of domination in graph theory has been introduced. The edge-subdivision and bondage
number notations and their implementations to the transportation network description and modelling were then
proposed. Furthermore, the possible usage of distinguishing concepts in an exemplary academic transportation
network has been shown. Finally, the conclusions and future directions of the work have been presented.