Academia.eduAcademia.edu

Figure 13 – uploaded by Mr.Sathish Kumar B BHC

See full PDFdownloadDownload figure
Figure 1.10: F-centroidalmean labeling of SL; F-centroidal mean labeling of SL¢ is shown in Figure 1.12. Hence, fis an F-centroidal mean labeling of SL, (n= 2). References:

Figure 1 10: F-centroidalmean labeling of SL; F-centroidal mean labeling of SL¢ is shown in Figure 1.12. Hence, fis an F-centroidal mean labeling of SL, (n= 2). References:

Related Figures (12)

be the edges which are denoted as in Figure 1.1. First we label the vertices as follows:
be the edges which are denoted as in Figure 1.1. First we label the vertices as follows:
Figure 1.2: F-centroidal mean labeling of D(T4) F-centroidal mean labeling of D(T4) is shown in Figure 1.2. Theorem: 2.3 Hence, fis an F-centroidal mean labeling of D(T,) (n= 3). The graph AD(T,) (n= 4) is an F-centroidal mean graph.
Figure 1.2: F-centroidal mean labeling of D(T4) F-centroidal mean labeling of D(T4) is shown in Figure 1.2. Theorem: 2.3 Hence, fis an F-centroidal mean labeling of D(T,) (n= 3). The graph AD(T,) (n= 4) is an F-centroidal mean graph.
First we label the vertices as follows: Then the induced edge labels are:
First we label the vertices as follows: Then the induced edge labels are:
Figure 1.4: F-centroidal mean labeling of AD(T;) F-centroidal mean labeling of AD(T¢) is shown in Figure 1.4. Definition: 2.4 An alternate quadrilateral snake A(Q,)is obtained from a path uj, Uy,........ , u, by joining u; and +1 tO a new vertices v;, wirespectively and then joining vjandw;. That is every alternative edge of a path placed by a Cycle Cy.
Figure 1.4: F-centroidal mean labeling of AD(T;) F-centroidal mean labeling of AD(T¢) is shown in Figure 1.4. Definition: 2.4 An alternate quadrilateral snake A(Q,)is obtained from a path uj, Uy,........ , u, by joining u; and +1 tO a new vertices v;, wirespectively and then joining vjandw;. That is every alternative edge of a path placed by a Cycle Cy.
Then the induced edge labels are: Hence, fis an F-centroidal mean labeling ofA(Q,) (n= 2).
Then the induced edge labels are: Hence, fis an F-centroidal mean labeling ofA(Q,) (n= 2).
F-centroidal mean labeling of A(Q¢) is shown in Figure 1.6.
F-centroidal mean labeling of A(Q¢) is shown in Figure 1.6.
F-centroidal mean labeling of Q, is shown in Figure 1.8. Theorem: 2.7 The graph AD(Q,) (n = 2) is an F-centroidal mean graph. Proof:
F-centroidal mean labeling of Q, is shown in Figure 1.8. Theorem: 2.7 The graph AD(Q,) (n = 2) is an F-centroidal mean graph. Proof:
Figure 1.9: Ordinary labeling of AD(Q,,) First we label the vertices as follows:
Figure 1.9: Ordinary labeling of AD(Q,,) First we label the vertices as follows:
asin Figure 1.11. First we label the vertices as follows: Let {U;, v,1Sis nf be the vertices and 14, 5D, ,¢,lSisgn— ly be the edges which are denoted
asin Figure 1.11. First we label the vertices as follows: Let {U;, v,1Sis nf be the vertices and 14, 5D, ,¢,lSisgn— ly be the edges which are denoted
F-centroidal mean labeling of AD(Q¢) is shown in Figure 1.10. Definition: 2.8
F-centroidal mean labeling of AD(Q¢) is shown in Figure 1.10. Definition: 2.8
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved