On the mutual visibility in Cartesian products and triangle-free graphs
Author
Abstract
Suggested Citation
DOI: 10.1016/j.amc.2022.127619
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Tian, Jing & Xu, Kexiang, 2021. "The general position number of Cartesian products involving a factor with small diameter," Applied Mathematics and Computation, Elsevier, vol. 403(C).
- Klavžar, Sandi & Rus, Gregor, 2021. "The general position number of integer lattices," Applied Mathematics and Computation, Elsevier, vol. 390(C).
- Anand, Bijo S. & Chandran S. V., Ullas & Changat, Manoj & Klavžar, Sandi & Thomas, Elias John, 2019. "Characterization of general position sets and its applications to cographs and bipartite graphs," Applied Mathematics and Computation, Elsevier, vol. 359(C), pages 84-89.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Ting Wang & Yu Jiang & Jianye Yang & Lei Xing, 2023. "Edge-Based Minimal k -Core Subgraph Search," Mathematics, MDPI, vol. 11(15), pages 1-17, August.
- Manuel, Paul & Brešar, Boštjan & Klavžar, Sandi, 2023. "Geodesic packing in graphs," Applied Mathematics and Computation, Elsevier, vol. 459(C).
- Brešar, Boštjan & Yero, Ismael G., 2024. "Lower (total) mutual-visibility number in graphs," Applied Mathematics and Computation, Elsevier, vol. 465(C).
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Tian, Jing & Xu, Kexiang, 2021. "The general position number of Cartesian products involving a factor with small diameter," Applied Mathematics and Computation, Elsevier, vol. 403(C).
- Klavžar, Sandi & Rus, Gregor, 2021. "The general position number of integer lattices," Applied Mathematics and Computation, Elsevier, vol. 390(C).
- Di Stefano, Gabriele, 2022. "Mutual visibility in graphs," Applied Mathematics and Computation, Elsevier, vol. 419(C).
More about this item
Keywords
Mutual-visibility set; Mutual-visibility number; Independent mutual-visibility set; Cartesian product of graphs; Zarenkiewicz’s problem; Triangle-free graph;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:438:y:2023:i:c:s0096300322006920. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.