• ADJACENT VERTEX SUM POLYNOMIAL

E. SUKUMARAN*

Abstract


Let G be a graph. The adjacent vertex sum polynomial is defined as S(G, x) = nD(G) – i . xaD(G) – i where D(G) = max {deg v/ v Î G}, nD(G) – i is the sum of the number of adjacent vertices of all the vertices of  degree D(G) – i and aD(G) – i is the sum of the degree of adjacent vertices of all the vertices of degree D(G) – i. In this paper I find the adjacent vertex sum polynomial of Cyclic graph, Complete graph, Generalized Peterson graph, Complete bipartite graph, Anti regular graph, Gear graph, Barbell graph and Book graph.


Keywords


Maximum degree, Adjacent vertices, Cyclic graph, Complete graph, Generalised Peterson graph, Complete bipartite graph , Anti regular graph, Gear graph, Barbell graph and Book graph.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter
https://journals.zetech.ac.ke/scatter-hitam/https://silasa.sarolangunkab.go.id/swal/https://sipirus.sukabumikab.go.id/storage/uploads/-/sthai/https://sipirus.sukabumikab.go.id/storage/uploads/-/stoto/https://alwasilahlilhasanah.ac.id/starlight-princess-1000/https://www.remap.ugto.mx/pages/slot-luar-negeri-winrate-tertinggi/https://waper.serdangbedagaikab.go.id/storage/sgacor/https://waper.serdangbedagaikab.go.id/public/images/qrcode/slot-dana/https://siipbang.katingankab.go.id/storage_old/maxwin/https://waper.serdangbedagaikab.go.id/public/img/cover/10k/https://waper.serdangbedagaikab.go.id/storage/app/https://waper.serdangbedagaikab.go.id/storage/idn/