首页 | 本学科首页   官方微博 | 高级检索  
     


Some Notes on Signed Edge Domination in Graphs
Authors:H.?Karami,S.?M.?Sheikholeslami,A.?Khodkar  author-information"  >  author-information__contact u-icon-before"  >  mailto:akhodkar@westga.edu"   title="  akhodkar@westga.edu"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author
Affiliation:(1) Department of Mathematics, Azarbaijan University of Tarbiat Moallem, Tabriz, I.R., Iran;(2) Department of Mathematics, University of West Georgia, Carrollton, GA 30118, USA
Abstract:The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having an end-vertex in common with e. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If $$sum_{xin N[e]}f(x) geq 1$$ for each eE(G), then f is called a signed edge dominating function of G. The signed edge domination number γs(G) of G is defined as $$gamma_s^prime(G) = {text{min}}{sum_{ein E(G)}f(e)mid f ,text{is an SEDF of} G}$$ . Recently, Xu proved that γs(G) ≥ |V(G)| − |E(G)| for all graphs G without isolated vertices. In this paper we first characterize all simple connected graphs G for which γs(G) = |V(G)| − |E(G)|. This answers Problem 4.2 of [4]. Then we classify all simple connected graphs G with precisely k cycles and γs(G) = 1 − k, 2 − k. A. Khodkar: Research supported by a Faculty Research Grant, University of West Georgia. Send offprint requests to: Abdollah Khodkar.
Keywords:Signed edge dominating function  Signed edge domination number
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号