• BRIDGE GRAPH RELATED FAMILIES OF E-CORDIAL GRAPHS

MUKUND V. BAPAT*

Abstract


The two copies of graph G(p,q) are joined by t paths on n-points  each. These paths are bridges between the two graphs. We represent the family by G(tPn).The paths are attached at the same fixed point on G. We discuss E-cordiality of C3(Pn), K4(Pn), S4(Pn) (shel graph  S4). We show that under certain conditions these graphs are E-cordial.


Keywords


graph, E-cordial, shel graph, C3, C4.

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.uol.edu.pk/sugar-rush/http://mysimpeg.gowakab.go.id/mysimpeg/aset/https://jurnal.jsa.ikippgriptk.ac.id/plugins/https://ppid.cimahikota.go.id/assets/demo/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/