Let \({\mathcal D(G)}\), \({\mathcal D}^L(G)={\mathcal Diag(Tr)} - {\mathcal D(G)}\) and \({\mathcal D}^Q(G)={\mathcal Diag(Tr)} + {\mathcal D(G)}\) b...

Let \(G\) be a graph of order \(n\). The energy \(\mathcal{E}(G)\) of a simple graph \(G\) is the sum of absolute values of the eigenvalues of its ...

We consider a dynamic game model of ride-sourcing, where a large number of private car owners provide rides to randomly appearing customers. Free drivers c...

The airline crew scheduling problem, because of its size and complexity, is usually solved in two phases: the crew pairing problem and the crew assignment pr...

We consider a static team problem in which agents observe correlated Gaussian observations and seek to minimize a quadratic cost. It is assumed that the ob...

We consider a dynamic marketing channel comprising of one manufacturer and one retailer, where consumer demand depends on price and on brand reputation. We...

Necessary and sufficient conditions are provided for the existence of a simple graph, or a simple connected graph with given numbers \(m_{ij}\) of edges ...

The object of study in the recent theory of Mean Field Games has been primarily large populations of agents interacting through a population dependent coupli...

The distance, distance Laplacian and distance signless Laplacian spectra of a connected graph \(G\) are the spectra of the distance, distance Laplacian and...

The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 ...

Given a complete directed graph \(G\) with weights on the vertices and on the arcs, a \(\theta\)-improper \(k\)-coloring of \(G\) is an assignment of...

In the present paper we are interested in the study of the distance Laplacian eigenvalues of a connected graph with fixed order \(n\) and chromatic number ...

The maximum \(k\)-colorable subgraph problem (\(k\)-MCSP) is to color as many vertices as possible with at most \(k\) colors, such that no two adjacent...

Network characterization and modelling is an important issue to understand and monitor IP network performance, in particular for real-time multimedia appli...

We consider a dynamic collective choice problem where a large number of players are cooperatively choosing between multiple destinations while being influenc...

In this paper we consider an interactive communication system with two users, who sequentially observe two correlated sources, and send the quantized observa...

The geometric-arithmetic index \(GA\) of a graph \(G\) is the sum of ratios, over all edges of \(G\), of the geometric mean to the arithmetic mean of t...

In the present paper, we prove lower and upper bounds for each of the ratios \(GA/\delta\), \(GA/\overline{d}\) and \(\Delta\), in terms of the order `...

In the present paper, we compare the geometric-arithmetic index \(GA\) and the chromatic number \(\chi\) of a connected graph with given order. We prove,...

Inspired by successful biological collective decision mechanisms such as honey bees searching for a new colony or the collective navigation of fish schoo...