 document

Van Mieghem, P.F.A. (author), Jokic, I. (author)Except for the empty graph, we show that the orthogonal matrix X of the adjacency matrix A determines that adjacency matrix completely, but not always uniquely. The proof relies on interesting properties of the Hadamard product Ξ = X ◦ X. As a consequence of the theory, we show that irregular coeigenvector graphs exist only if the number of...journal article 2024
 document

Qiu, Z. (author), Jokic, I. (author), Tang, Siyu (author), Noldus, R.A.C.J. (author), Van Mieghem, P.F.A. (author)Although resource management schemes and algorithms for networks are well established, we present two novel ideas, based on graph theory, that solve inverse all shortest path problem. Given a symmetric and nonnegative demand matrix, the inverse all shortest path problem (IASPP) asks to find a weighted adjacency matrix of a graph such that...journal article 2024
 document

Jokic, I. (author)The concept of a network, defined as a collection of interconnected nodes or entities, has become a foundation for a new field of inquiry, namely network science. Despite the apparent simplicity of the concept, the pairwise representation of interconnecting nodes has enabled a plethora of insights into the structure of networks and the effects...doctoral thesis 2023
 document

Jokic, I. (author), Van Mieghem, P.F.A. (author)We propose a linear clustering process on a network consisting of two opposite forces: attraction and repulsion between adjacent nodes. Each node is mapped to a position on a onedimensional line. The attraction and repulsion forces move the nodal position on the line, depending on how similar or different the neighbourhoods of two adjacent...journal article 2023