Oct 22, 2024 · Let Γn,q denote the point-line incidence graph of the finite projective space PG(n, q). The two sets of vertices of this bipartite graph ...
It is proved that if n > 2 is fixed, then the metric dimension of the graph is asymptotically 2 q n − 1 . Lower and upper bounds on the size of resolving ...
TL;DR: In this paper, lower and upper bounds on the size of resolving sets for the point-hyperplane incidence graph of the finite projective space PG (n, q ) ...
Lower and upper bounds on the size of resolving sets and semi-resolving sets for the point-line incidence graph of the finite projective space PG(n, q) are ...
People also ask
What is resolving set in graph theory?
On resolving sets in the point-line incidence graph of PG(n; q). ARS MATHEMATICA CONTEMPORANEA, vol. 19, p. 231-247, ISSN: 1855-3974, doi: 10.26493/1855 ...
We prove that for a semi-resolving set S in the incidence graph of PG(2,q), |S|≥ min {2q+q/4-3, τ2-2} holds. In particular, if q≥9 is a square, then the ...
Lower and upper bounds on the size of resolving sets for the point-hyperplane incidence graph of the finite projective space PG ( n , q ) are presented.
Lower and upper bounds on the size of resolving sets for the point-hyperplane incidence graph of the finite projective space PG(n, q) are presented. For a ...
This work focuses on higgledy-piggledy sets of $k$-subspaces in $\text{PG}(N,q)$, i.e. sets of projective subspaces that are 'well-spread-out'.
We prove that for a semi-resolving set S in the incidence graph of PG(2,q), ... set of q + √q + 1 points that intersects every line ... set of PG(2,q) by a set of ...