4 citations · 6 across the 8 of their papers we have counts for
8 papers
Corrigendum on Wiener index, Zagreb Indices and Harary index of Eulerian graphs
Stijn Cambie
In the original article ``Wiener index of Eulerian graphs'' [Discrete Applied Mathematics Volume 162, 10 January 2014, Pages 247-250], the authors state that the Wiener index (tota…
Decreasing the mean subtree order by adding edges
Stijn Cambie, Guantao Chen, Yanli Hao +1
The mean subtree order of a given graph , denoted , is the average number of vertices in a subtree of . Let be a connected graph. Chin, Gordon, MacPhee, and Vincent…
The Erdős distinct subset sums problem in a modular setting
Stijn Cambie, Jun Gao, Younjin Kim +1
We prove the following variant of the Erdős distinct subset sums problem. Given and sufficiently large , every -element set whose subset sums are distinct modul…
The maximum Wiener index of a uniform hypergraph
Stijn Cambie, Ervin Győri, Nika Salia +2
The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected -vertex…
Many Hamiltonian subsets in large graphs with given density
Stijn Cambie, Jun Gao, Hong Liu
A set of vertices in a graph is a Hamiltonian subset if it induces a subgraph containing a Hamiltonian cycle. Kim, Liu, Sharifzadeh and Staden proved that among all graphs with min…
Extremal and monotone behaviour of the Sudoku number and related critical set parameters
Stijn Cambie
The Sudoku number has been defined under various names, indicating it is a natural concept. There are four variants of this parameter, that can be related to the maximum and minimu…