Scientific Research An Academic Publisher
OPEN ACCESS
Add your e-mail address to receive free newsletters from SCIRP.
Select Journal AA AAD AAR AASoci AAST ABB ABC ABCR ACES ACS ACT AD ADR AE AER AHS AID AiM AIT AJAC AJC AJCC AJCM AJIBM AJMB AJOR AJPS ALAMT ALC ALS AM AMI AMPC ANP APD APE APM ARS ARSci AS ASM BLR CC CE CellBio ChnStd CM CMB CN CRCM CS CSTA CUS CWEEE Detection EMAE ENG EPE ETSN FMAR FNS GEP GIS GM Graphene GSC Health IB ICA IIM IJAA IJAMSC IJCCE IJCM IJCNS IJG IJIDS IJIS IJMNTA IJMPCERO IJNM IJOC IJOHNS InfraMatics JACEN JAMP JASMI JBBS JBCPR JBiSE JBM JBNB JBPC JCC JCDSA JCPT JCT JDAIP JDM JEAS JECTC JEMAA JEP JFCMV JFRM JGIS JHEPGC JHRSS JIBTVA JILSA JIS JMF JMGBND JMMCE JMP JPEE JQIS JSBS JSEA JSEMAT JSIP JSS JSSM JST JTR JTST JTTs JWARP LCE MC ME MI MME MNSMS MPS MR MRC MRI MSA MSCE NJGC NM NR NS OALib OALibJ ODEM OJA OJAB OJAcct OJAnes OJAP OJApo OJAppS OJAPr OJAS OJBD OJBIPHY OJBM OJC OJCB OJCD OJCE OJCM OJD OJDer OJDM OJE OJEE OJEM OJEMD OJEpi OJER OJF OJFD OJG OJGas OJGen OJI OJIC OJIM OJINM OJL OJM OJMC OJMetal OJMH OJMI OJMIP OJML OJMM OJMN OJMP OJMS OJMSi OJN OJNeph OJO OJOG OJOGas OJOp OJOph OJOPM OJOTS OJPathology OJPC OJPChem OJPed OJPM OJPP OJPS OJPsych OJRA OJRad OJRD OJRM OJS OJSS OJSST OJST OJSTA OJTR OJTS OJU OJVM OPJ POS PP PST PSYCH SAR SCD SGRE SM SN SNL Soft SS TEL TI UOAJ VP WET WJA WJCD WJCMP WJCS WJET WJM WJNS WJNSE WJNST WJV WSN YM
More>>
J. B. Babujee, “Bimagic Labeling in Path Graphs,” The Mathematics Education, Vol. 38, No. 1, 2004, pp. 12-16.
has been cited by the following article:
TITLE: New Constructions of Edge Bimagic Graphs from Magic Graphs
AUTHORS: Jayapal Baskar Babujee, Babitha Suresh
KEYWORDS: Graph, Labeling, Magic Labeling, Bimagic Labeling, Function
JOURNAL NAME: Applied Mathematics, Vol.2 No.11, November 30, 2011
ABSTRACT: An edge magic total labeling of a graph G(V,E) with p vertices and q edges is a bijection f from the set of vertices and edges to such that for every edge uv in E, f(u) + f(uv) + f(v) is a constant k. If there exist two constants k1 and k2 such that the above sum is either k1 or k2, it is said to be an edge bimagic total labeling. A total edge magic (edge bimagic) graph is called a super edge magic (super edge bimagic) if f(V(G)) = . In this paper we define super edge edge-magic labeling and exhibit some interesting constructions related to Edge bimagic total labeling.
Related Articles:
Comment on the Paper “Condom-Assisted Transurethral Resection: A New Surgical Technique for Urethral Tumor”, Surgical Science, Vol. 1, 2010, pp. 46-48
Guven Aslan
DOI: 10.4236/ss.2011.24042 4,539 Downloads 7,512 Views Citations
Pub. Date: June 23, 2011
Mean Cordial Labeling of Graphs
Raja Ponraj, Muthirulan Sivakumar, Murugesan Sundaram
DOI: 10.4236/ojdm.2012.24029 5,917 Downloads 10,480 Views Citations
Pub. Date: November 1, 2012
New Constructions of Edge Bimagic Graphs from Magic Graphs
Jayapal Baskar Babujee, Babitha Suresh
DOI: 10.4236/am.2011.211197 5,060 Downloads 9,375 Views Citations
Pub. Date: November 30, 2011
Prime Cordial Labeling of Some Graphs
Samir K. Vaidya, Nirav H. Shah
DOI: 10.4236/ojdm.2012.21003 8,987 Downloads 19,171 Views Citations
Pub. Date: January 20, 2012
Zero-M-Cordial Labeling of Some Graphs
Freeda Selvanayagom, Robinson S. Chellathurai
DOI: 10.4236/am.2012.311228 3,319 Downloads 5,013 Views Citations
Pub. Date: November 20, 2012
