Intelligent Information Management

Volume 2, Issue 2 (February 2010)

ISSN Print: 2160-5912   ISSN Online: 2160-5920

Google-based Impact Factor: 1.6  Citations  

Signed (b,k)-Edge Covers in Graphs

HTML  Download Download as PDF (Size: 253KB)  PP. 143-148  
DOI: 10.4236/iim.2010.22017    4,456 Downloads   7,939 Views  Citations

Affiliation(s)

.

ABSTRACT

Let be a simple graph with vertex set and edge set . Let have at least vertices of degree at least , where and are positive integers. A function is said to be a signed -edge cover of if for at least vertices of , where . The value , taking over all signed -edge covers of is called the signed -edge cover number of and denoted by . In this paper we give some bounds on the signed -edge cover number of graphs.

Share and Cite:

Ghameshlou, A. , Khodkar, A. , Saei, R. and Sheikholeslami, S. (2010) Signed (b,k)-Edge Covers in Graphs. Intelligent Information Management, 2, 143-148. doi: 10.4236/iim.2010.22017.

Cited by

[1] ON THE SIGNED MATCHINGS OF GRAPHS
2020
[2] A note on signed k-matching in graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2016
[3] A Note on Signed k-Submatching in Graphs
arXiv preprint arXiv:1411.0132, 2014
[4] Signed star k-domatic number of a graph
Contributions to Discrete Mathematics, 2011
[5] Signed k-Domatic Numbers of Digraphs
The Bulletin of the Malaysian Mathematical Society Series 2, 2011

Journals Menu
Follow SCIRP
Contact us
+1 323-425-8868
customer@scirp.org
WhatsApp +86 18163351462(WhatsApp)
Click here to send a message to me 1655362766
Paper Publishing WeChat

Copyright © 2024 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.