Professor Matthew Johnson matthew.johnson2@durham.ac.uk
Head Of Department
What graphs are 2-dot product graphs?
Johnson, M.; Paulusma, D.; van Leeuwen, E.J.
Authors
Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor
E.J. van Leeuwen
Abstract
Let d ≥ 1 be an integer. From a set of d-dimensional vectors, we obtain a d-dot product graph by letting each vector a u correspond to a vertex u and by adding an edge between two vertices u and v if and only if their dot product a u · a v ≥ t, for some fixed, positive threshold t. Dot product graphs can be used to model social networks. Recognizing a d-dot product graph is known to be NP-hard for all fixed d ≥ 2. To understand the position of d-dot product graphs in the landscape of graph classes, we consider the case d = 2, and investigate how 2-dot product graphs relate to a number of other known graph classes including a number of well-known classes of intersection graphs.
Citation
Johnson, M., Paulusma, D., & van Leeuwen, E. (2021). What graphs are 2-dot product graphs?. International Journal of Computational Geometry and Applications, 31(01), 1-16. https://doi.org/10.1142/s0218195921500011
Journal Article Type | Article |
---|---|
Acceptance Date | Jun 26, 2021 |
Online Publication Date | Sep 10, 2021 |
Publication Date | 2021-03 |
Deposit Date | Aug 23, 2021 |
Publicly Available Date | Sep 10, 2022 |
Journal | International Journal of Computational Geometry and Applications |
Print ISSN | 0218-1959 |
Electronic ISSN | 1793-6357 |
Publisher | World Scientific Publishing |
Peer Reviewed | Peer Reviewed |
Volume | 31 |
Issue | 01 |
Pages | 1-16 |
DOI | https://doi.org/10.1142/s0218195921500011 |
Public URL | https://durham-repository.worktribe.com/output/1243268 |
Files
Accepted Journal Article
(389 Kb)
PDF
Copyright Statement
Electronic version of an article published as International Journal of Computational Geometry & Applications, 31, 01, 2021, 1-16, 10.1142/S0218195921500011. © [copyright World Scientific Publishing Company] https://www.worldscientific.com/doi/10.1142/S0218195921500011
You might also like
The Complexity of Matching Games: A Survey
(2023)
Journal Article
Computing weighted subset odd cycle transversals in H-free graphs
(2022)
Journal Article
Computing subset transversals in H-free graphs
(2021)
Journal Article
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective
(2021)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search