Abstract
A graph [Formula: see text] is called a [Formula: see text]-dot product graph if there is a function [Formula: see text] such that for any two distinct vertices [Formula: see text] and [Formula: see text], [Formula: see text] if and only if [Formula: see text]. The minimum value [Formula: see text] such that [Formula: see text] is a [Formula: see text]-dot product graph, is called the dot product dimension [Formula: see text] of [Formula: see text]. In this paper, we give an efficient algorithm for computing the dot product dimension of outerplanar graphs of at most two edge-disjoint cycles. If the graph has two cycles, we only consider those outerplanar graphs if both cycles have exactly one vertex in common and the length of one of the cycles is greater than or equal to six.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
