Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
The cordiality of one-point union of n copies of a graph
Home
Publications
The cordiality of one-point union of n copies of a graph
The cordiality of one-point union of n copies of a graph
Authors:
SS
Sze-Chin Shee
Sze-Chin Shee
YH
Yong-Song Ho
Yong-Song Ho
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Open Access
Publisher website
Google Scholar
1 July 1993
journal article
Published by
Elsevier
in
Discrete Mathematics
Vol. 117
(1-3)
,
225-243
DOI:
10.1016/0012-365x(93)90337-s
Abstract
No abstract available
Keywords
GRAPH
FANS
BINARY
SOLVABILITY
FLAGS
INFINITE
EDGES
GIVE
NONCORDIAL
Cited
Cited by 21 articles
Scroll to top