Skip to main content
SpringerLink
Log in

Identifying codes for generalized quadrangles

  • Published:
Journal of Geometry Aims and scope Submit manuscript

Abstract

We improve the known bounds on the size of identifying codes in the collinearity graphs of generalized quadrangles.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Data availability

This manuscript has no associated data.

References

  1. Gravier, S., Parreau, A., Rottey, S., Storme, L., Vandomme, É.: Identifying codes in vertex-transitive graphs and strongly regular graphs. Electron. J. Combin. 22 (2015), # P4.6.

  2. Gurobi Optimization.: Gurobi Optimizer 8.1. https://www.gurobi.com

  3. Higman, D.G.: Partial geometries, generalized quadrangles and strongly regular graphs. Atti del Convegno di Geometria Combinatoria e sue Applicazioni (Univ. Perugia, Perugia, 1970), pp. 263–293. Ist. Mat., Univ. Perugia, Perugia (1971).

  4. Hirschfeld, J.W.P.: Finite Projective Spaces of Three Dimensions. Clarendon Press, Oxford (1985)

    Google Scholar 

  5. Hirschfeld, J.W.P.: Projective Geometries over Finite Fields, 2nd edn Clarendon Press, Oxford (1998)

    Book  Google Scholar 

  6. Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in a graph. IEEE Trans. Inform. Theory 44, 599–611 (1998)

    Article  MathSciNet  Google Scholar 

  7. Kiss, Gy., Szőnyi, T.: Finite Geometries. CRC Press, Boca Raton (2019).

  8. Moorhouse, E.: Generalised Quadrangles of Small Order. Web page. Available at http://ericmoorhouse.org/pub/genpoly/. Last accessed 25th of October (2021)

  9. Payne, S.E., Thas, J.A.: Finite Generalized Quadrangles, 2nd edn. European Mathematical Society Publishing House, Zürich (2009)

Download references

Acknowledgements

The authors thank the referees for the many suggestions which improved the text of the article.

Author information

Authors and Affiliations

  1. ELKH-ELTE Geometric and Algebraic Combinatorics Research Group, Department of Computer Science, ELTE Eötvös Loránd University, Pázmány Péter sétány 1/C, Budapest, 1117, Hungary

    Tamás Héger

  2. Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Müegyetem rkp. 3, Budapest, 1111, Hungary

    Tamás Héger

  3. Department of Geometry and ELKH-ELTE Geometric and Algebraic Combinatorics Research Group, ELTE Eötvös Loránd University, Pázmány Péter sétány 1/C, Budapest, 1117, Hungary

    György Kiss

  4. FAMNIT, University of Primorska, Glagoljaška 8, 6000, Koper, Slovenia

    György Kiss

  5. Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000, Zagreb, Croatia

    Anamari Nakić

  6. Department of Mathematics: Analysis, Logic and Discrete Mathematics, Ghent University, Krijgslaan 281 - Building S8, 9000, Ghent, Belgium

    Leo Storme

Authors
  1. Tamás Héger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. György Kiss
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anamari Nakić
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Leo Storme
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leo Storme.

Ethics declarations

Conflict of interest

On behalf of all authors, the corresponding author states that there is no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

The first author was supported in part by the Ministry of Innovation and Technology and Hungarian National Research, Development and Innovation Office OTKA Grant No. K 124950 and also within the Artificial Intelligence National Laboratory of Hungary. The first, second and fourth authors were supported by the FWO-HAS bilateral research project “Substructures in finite projective spaces: algebraic and extremal questions” (VS.069.18N), and by the FWO-HAS bilateral research project “Intertwined research questions on graphs and geometries and direction problems” (VS.074.20N). The research of the second author was supported in part by the Hungarian National Research, Development and Innovation Office OTKA Grant No. SNN 132625, and by the Slovenian Research Agency (research project J1-9110). The third author was supported by the Croatian Science Foundation under the project 9752.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Héger, T., Kiss, G., Nakić, A. et al. Identifying codes for generalized quadrangles. J. Geom. 115, 9 (2024). https://doi.org/10.1007/s00022-023-00707-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00022-023-00707-0

Keywords

Mathematics Subject Classification

Search

Navigation