Abstract
Let be a graph with vertices and edges. The th hilbert number is denoted by and is defined by where A - hilbert mean labeling is an injective function , where that induces a bijection defined by
 for all . A graph which admits such labeling is called a - hilbert mean graph. In this paper, a new type of labeling called - hilbert mean labeling is introduced and the path related graphs is studied.
 AMS Subject Classification – 05C78
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 callDisclaimer: 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.
