 |
International Journal for Research Trends and Innovation
International Peer Reviewed & Refereed Journals, Open Access Journal
ISSN Approved Journal No: 2456-3315 | Impact factor: 8.14 | ESTD Year: 2016
Scholarly open access journals, Peer-reviewed, and Refereed Journals, Impact factor 8.14 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool) , Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(DOI)
|
Issue: March 2026
Volume 11 | Issue 3
Review Result and Publication of Paper within : 2-3 days
Click Here For more DetailsFor Authors
Forms / Download
Published Issue Details
Editorial Board
Other IMP Links
Facts & Figure
Impact Factor : 8.14
Issue per Year : 12
Volume Published : 11
Issue Published : 118
Article Submitted : 21605
Article Published : 8531
Total Authors : 22438
Total Reviewer : 805
Total Countries : 159
Indexing Partner
Licence
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
Published Paper Details
|
|
| Paper Title: | REENGINEERING CORDIAL LABELING OF ONE POINT UNION OF SOME GRAPHS |
| Authors Name: | SREEJIL.K , RAJAKUMARI N |
| Download E-Certificate: | Download |
| Author Reg. ID: |
IJRTI_180527
|
| Published Paper Id: | IJRTI1810010 |
| Published In: | Volume 3 Issue 10, October-2018 |
| DOI: | |
| Abstract: | : A graph H in which a vertex is distinguished from other vertices is called a rooted graph and the vertex is called the root of H. Let H be a rooted graph. The graph H(n) obtained by identifying the roots of n copies of H is called the one-point union of n copies of the graph H. A function from vertex set of a graph to the set {0,1}, which assigns the label |f(u)-f(v)| or each edge uv, is called a cordial labelling of the graph if the number of vertices labelled 0 and number of vertices labelled 1 differ by at most 1, and similar condition is satisfied by the edges of the graph. In this paper we discuss cordial labelling of one point union of grid graph, cycle with one chord and cycle with twin chords. |
| Keywords: | Cordial graph, One Point Union |
| Cite Article: | "REENGINEERING CORDIAL LABELING OF ONE POINT UNION OF SOME GRAPHS", International Journal for Research Trends and Innovation (www.ijrti.org), ISSN:2455-2631, Vol.3, Issue 10, page no.55 - 59, October-2018, Available :http://www.ijrti.org/papers/IJRTI1810010.pdf |
| Downloads: | 000205216 |
| ISSN: |
2456-3315 | IMPACT FACTOR: 8.14 Calculated By Google Scholar| ESTD YEAR: 2016 An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 8.14 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator |
| Publication Details: |
Published Paper ID: IJRTI1810010
Registration ID:180527
Published In: Volume 3 Issue 10, October-2018
DOI (Digital Object Identifier):
Page No: 55 - 59 Country: kozhikode, kerala, India Research Area: Applied Mathematics Publisher : IJ Publication Published Paper URL : https://www.ijrti.org/viewpaperforall?paper=IJRTI1810010 Published Paper PDF: https://www.ijrti.org/papers/IJRTI1810010 |
| Share Article: | |
|
Click Here to Download This Article |
|
| Article Preview | |
|
|
|
Major Indexing from www.ijrti.org
| Google Scholar | ResearcherID Thomson Reuters | Mendeley : reference manager | Academia.edu |
| arXiv.org : cornell university library | Research Gate | CiteSeerX | DOAJ : Directory of Open Access Journals |
| DRJI | Index Copernicus International | Scribd | DocStoc |
ISSN Details
 |
 |
|
ISSN: 2456-3315
Impact Factor: 8.14 and ISSN APPROVED,
Journal Starting Year (ESTD) : 2016
DOI (A digital object identifier)
| Providing A digital object identifier by DOI.ONE How to Get DOI? |
Conference
Open Access License Policy
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
Important Details
Join RMS/Earn 300
WhatsApp
Click Here
Click Here
Indexing Partner |
|||
| Copyright © 2026 - All Rights Reserved - IJRTI | |||