Strong matching preclusion of ( n , k )-star graphs

Cheng, Eddie W.L.; Kelm, Justin; Renzi, Joseph

doi:10.1016/j.tcs.2015.11.051

Record: found
Abstract: not found
Article: not found

Strong matching preclusion of ( n , k )-star graphs

Author(s): Eddie Cheng , Justin Kelm , Joseph Renzi

Publication date Created: February 2016

Publication date (Print): February 2016

Journal: Theoretical Computer Science

Publisher: Elsevier BV

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Journal

Title: Theoretical Computer Science

Abbreviated Title: Theoretical Computer Science

Publisher: Elsevier BV

ISSN (Print): 03043975

Publication date Created: February 2016

Publication date (Print): February 2016

Volume: 615

Pages: 91-101

Article

DOI: 10.1016/j.tcs.2015.11.051

SO-VID: 6e0668b2-5618-4f56-8952-8a3a28df2056

License:

https://www.elsevier.com/tdm/userlicense/1.0/

History

Data availability:

Strong matching preclusion of ( n , k )-star graphs

Read this article at

Related collections

CHAIN Network Collection

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 398

Cited by 1