The adjacency dimension bound for the join of a graph with a universal vertex
Let be a graph of order , let denote the graph obtained by adding a universal vertex to , and let be its adjacency threshold. For , write for the -adjacency dimension of a graph . Adjacency dimension bound.
The bound gives an upper estimate for the adjacency dimension of a graph formed by adjoining a universal vertex, and the surrounding example shows that it can be tight. The supplied text does not state whether the bound has been proved or remains open.
References
- A. Estrada-Moreno, Y. Ramirez-Cruz and J. A. Rodriguez-Velazquez, “On the adjacency dimension of graphs”, arXiv:1501.04647 (2015).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.