Bibliographic Details
| Title: |
ON THE SIGNED MATCHINGS OF GRAPHS. |
| Authors: |
Javan, Samane1 javan.samane@gmail.com, Maimani, Hamid Reza2 maimani@ipm.ir |
| Superior Title: |
Facta Universitatis, Series: Mathematics & Informatics. 2020, Vol. 35 Issue 2, p541-547. 7p. |
| Abstract: |
For a graph G and any v ∈ V (G), EG(v) is the set of all edges incident with v. A function f : E(G) → {-1, 1} is called a signed matching of G if e∈EG(v) f(e) ≤ 1 for every v ∈ V (G). The weight of a signed matching f, is defined by w(f) = e∈E(G)) f(e). The signed matching number of G, denoted by β'1(G), is the maximum w(f) where the maximum is taken over all signed matchings over G. In this paper, we have obtained the signed matching number of some families of graphs and studied the signed matching number of subdivision and the edge deletion of edges of a graph. [ABSTRACT FROM AUTHOR] |
|
Copyright of Facta Universitatis, Series: Mathematics & Informatics is the property of University of Nis, Serbia and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Premier |
