Indexing Metadata
| 1 | Title of the Article | Classification of Some {0,1}-Semigraphs |
| 2 | Author's name | Ibrahim GUNALTILI: Mathematics-Computer Department, EskiÅŸehir Osmangazi University, EskiÅŸehir,TURKEY |
| 3 | Author's name | |
| 4 | Subject | Science & Engineering |
| 5 | Keyword(s) | A-semigraph, bipartite graph AMS Subject Classification: 51E20 , 51A45. |
| 6 | Abstract | An adjacent graph is a connected bipartite {0,1}-semigraph which contains exactly one part in which any two vertices have exactly one common neighbour. Mulder [1] observed that; (0, λ) -semigraphs are regular. Furthermore a lower bound for the degree of (0,n)-semi graphs with diameter at least four was derived by Mulder [1]. In this paper, we find all -graphs and (0,1)-graphs. Furthermore, we determined some basic properties of adjacent graphs, where, λ≥1.a |
| 7 | Publisher | Innovative Research Publication |
| 8 | Journal Name; vol., no. | International Journal of Innovative Research in Computer Science & Technology (IJIRCST); Volume-4 Issue-1 |
| 9 | Publication Date | January 2016 |
| 10 | Type | Peer-reviewed Article |
| 11 | Format | |
| 12 | Uniform Resource Identifier | https://ijircst.org/view_abstract.php?title=Classification-of-Some-{0,1}-Semigraphs&year=2016&vol=4&primary=QVJULTI0Ng== |
| 13 | Digital Object Identifier(DOI) | |
| 14 | Language | English |
| 15 | Page No | 10-12 |
Index Copernicus Value (ICV): 100.00
IJIRCST is a member of the prestigious CrossRef. Each of the IJIRCST articles has its unique DOI reference. Learn more
ISSN(Online) for IJIRCST Digital Library is 2347-5552 Learn more
