Open Journal of Discrete Mathematics

Vol.6 No.4(2016), Paper ID 70074, 11 pages

DOI:10.4236/ojdm.2016.64019

 

An Alternative Proof of the Largest Number of Maximal Independent Sets in Connected Graphs Having at Most Two Cycles

 

Min-Jen Jou, Jenq-Jong Lin

 

Department of Information Technology, Ling Tung University, Taichung City
Department of Finance, Ling Tung University, Taichung City

 

Copyright © 2016 Min-Jen Jou, Jenq-Jong Lin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

 

How to Cite this Article

Jou, M. and Lin, J. (2016) An Alternative Proof of the Largest Number of Maximal Independent Sets in Connected Graphs Having at Most Two Cycles. Open Journal of Discrete Mathematics, 6, 227-237. doi: 10.4236/ojdm.2016.64019.
Journals Menu
Follow SCIRP
Contact us
customer@scirp.org
WhatsApp +86 18163351462
(WhatsApp)
Click here to send a message to me 1655362766

SCIRP WeChat

Copyright © 2026 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.