Some New Results in the Alcuin Number of Graphs

Some New Results in the Alcuin Number of Graphs

We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on common neighbors) is sufficient as well. By using this classifica...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2014-09
Hauptverfasser: Abbas Seify, Shahmohamad, Hossein
Format: Artikel
Sprache:eng
Schlagworte:
Classification
Graphs
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Abbas Seify
Shahmohamad, Hossein
description We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on common neighbors) is sufficient as well. By using this classification theorem, we prove some results about class one and class two graphs such as cartesian product of graphs and classification of regular graphs.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2084486589</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2084486589</sourcerecordid><originalsourceid>FETCH-proquest_journals_20844865893</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQD87PTVXwSy1XCEotLs0pKVbIzFMoyUhVcMxJLgUy_Upzk1KLFPLTFNyLEgsyinkYWNMSc4pTeaE0N4Oym2uIs4duQVF-YWlqcUl8Vn5pUR5QKt7IwMLExMLM1MLSmDhVAMYJMec</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2084486589</pqid></control><display><type>article</type><title>Some New Results in the Alcuin Number of Graphs</title><source>Free E- Journals</source><creator>Abbas Seify ; Shahmohamad, Hossein</creator><creatorcontrib>Abbas Seify ; Shahmohamad, Hossein</creatorcontrib><description>We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on common neighbors) is sufficient as well. By using this classification theorem, we prove some results about class one and class two graphs such as cartesian product of graphs and classification of regular graphs.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Classification ; Graphs</subject><ispartof>arXiv.org, 2014-09</ispartof><rights>2014. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>777,781</link.rule.ids></links><search><creatorcontrib>Abbas Seify</creatorcontrib><creatorcontrib>Shahmohamad, Hossein</creatorcontrib><title>Some New Results in the Alcuin Number of Graphs</title><title>arXiv.org</title><description>We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on common neighbors) is sufficient as well. By using this classification theorem, we prove some results about class one and class two graphs such as cartesian product of graphs and classification of regular graphs.</description><subject>Classification</subject><subject>Graphs</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQD87PTVXwSy1XCEotLs0pKVbIzFMoyUhVcMxJLgUy_Upzk1KLFPLTFNyLEgsyinkYWNMSc4pTeaE0N4Oym2uIs4duQVF-YWlqcUl8Vn5pUR5QKt7IwMLExMLM1MLSmDhVAMYJMec</recordid><startdate>20140924</startdate><enddate>20140924</enddate><creator>Abbas Seify</creator><creator>Shahmohamad, Hossein</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20140924</creationdate><title>Some New Results in the Alcuin Number of Graphs</title><author>Abbas Seify ; Shahmohamad, Hossein</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20844865893</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Classification</topic><topic>Graphs</topic><toplevel>online_resources</toplevel><creatorcontrib>Abbas Seify</creatorcontrib><creatorcontrib>Shahmohamad, Hossein</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Abbas Seify</au><au>Shahmohamad, Hossein</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Some New Results in the Alcuin Number of Graphs</atitle><jtitle>arXiv.org</jtitle><date>2014-09-24</date><risdate>2014</risdate><eissn>2331-8422</eissn><abstract>We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on common neighbors) is sufficient as well. By using this classification theorem, we prove some results about class one and class two graphs such as cartesian product of graphs and classification of regular graphs.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2014-09
issn 2331-8422
language eng
recordid cdi_proquest_journals_2084486589
source Free E- Journals
subjects Classification
Graphs
title Some New Results in the Alcuin Number of Graphs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T04%3A44%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Some%20New%20Results%20in%20the%20Alcuin%20Number%20of%20Graphs&rft.jtitle=arXiv.org&rft.au=Abbas%20Seify&rft.date=2014-09-24&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2084486589%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2084486589&rft_id=info:pmid/&rfr_iscdi=true