Distance-preserving orderings in graphs

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rh ˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT

We also show that computing the outer multiset dimension of arbitrary graphs is NP-hard, and provide methods for efficiently handling particular cases.. © 2019

In this paper, we define new polynomials called chromatic D-polynomial and modified chromatic D-polynomial in terms of minimal parameter coloring and structural characteristics

To solve the problem approximately, we built a constructive heuristic algorithm (CH) to obtain an initial feasible solution for the obtained CVRP with sparse feasibility graph..

Keywords: Graphs, algebraic graph theory, spectral graph theory, unicyclic graphs, Laplacian matrix, adjacency matrix, graphs determined by their spectrum, sun graphs..

NBUIFNBUJDBM PCKFDU DBMMFE B HSBQI JU JT DPODFSOFE JO EFTJHOJOH GBTU BMHPSJUINT UP QBSUJUJPO JU UIF HSBQI JOUP UIF NBYJNVN OVNCFS PG DPOOFDUFE DPVQMFT ćJT JT LOPXO JO HSBQI UIFPSZ BT

A two-dimensional cross section generation methodology using the Monte Carlo code Serpent, similar to the traditional deterministic homogenization methodology, was used

On the other hand, we construct a FVS V in this way: we skip the t first vertices and we pick alternately one on two of the n − t last vertices (see Figure 1). Assume that the