並列摘要
Given a sigraph S and a positive integer t, the t-path sigraph (S)(subscript t) of S is formed by taking a copy of the vertex set V (S) of S, joining two vertices u and v in the copy by a single edge e=uv whenever there is a u-v path of length t in S and then by defining its sign to be-whenever in every u-v path of length t in S all the edges are negative. In this paper, we introduce a variation of the concept of t-path sigraphs studied above. The motivation stems naturally from one's mathematically inquisitiveness as to ask why not define the sign of an edge e=uv in (S) (subscript t) as the product of the signs of the vertices u and v in S. It is shown that for any sigraph S, its t-path sigraph (S) (subscript t) is balanced. We then give structural characterization of t-path sigraphs. Further, in this paper we characterize sigraphs which are switching equivalent to their 2(3)-path sigraphs.
被引用紀錄
延伸閱讀
- Alameddine, A. F. (1991). FROM PATHS TO STARS. International Journal of Mathematics and Mathematical Sciences, 1991(), 345-348. https://doi.org/10.1155/S0161171291000418
- Lee, H. C., & Chen, W. L. (2011). Packing and Covering Complete Graphs with 3- and 4-paths. 嶺東學報, (30), 227-240. https://doi.org/10.29850/LTJ.201112.0009
- 郭瀚文（2014）。Target Set Selection Problem on Paths and Grids〔碩士論文，國立中央大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0031-0412201511580385
- 羅文益（2011）。Parallel ATPG using Multiple Threads〔碩士論文，中原大學〕。華藝線上圖書館。https://doi.org/10.6840/cycu201100623
- Tseng, Y. W. (2012). On (p,1)-total labelings of regular graphs [master's thesis, Chung Yuan Christian University]. Airiti Library. https://doi.org/10.6840/cycu201200646