Author:
Gologranc Tanja,Repolusk Polona
Funder
Slovenian Research Agency
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference22 articles.
1. A note on path domination;Alcón;Discuss. Math. Graph Theory,2016
2. Toll convexity;Alcón;European J. Combin.,2015
3. On the geodetic number and related metric sets in Cartesian product graphs;Brešar;Discrete Math.,2008
4. Geodetic sets in graphs;Brešar,2010
5. The geodetic number of the lexicographic product of graphs;Brešar;Discrete Math.,2011
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Upper Bound of Edge Forwarding Index of Special Strong Product Networks;2024 4th International Conference on Computer Communication and Artificial Intelligence (CCAI);2024-05-24
2. Minimum Strong Radius of the Strong Product of Cycles and Even Paths;2024 13th International Conference on Communications, Circuits and Systems (ICCCAS);2024-05-10
3. Minimum Strong Radius of the Strong Product of Cycles and Odd Paths;2024 7th World Conference on Computing and Communication Technologies (WCCCT);2024-04-12
4. Weakly Toll Convexity in Graph Products;2024
5. The Wide Diameter of Strong Product Graphs of Complete Graphs and any Graphs;2023 IEEE 11th International Conference on Information, Communication and Networks (ICICN);2023-08-17