On the dot product of graphs over monogenic semigroups

Nihat Akgüneş and Büşra Çağan

Applied Mathematics and Computation, 2018, vol. 322, issue C, 1-5

Abstract: Now define S a cartesian product of finite times with SMn which is a finite semigroup having elements {0,x,x2,…,xn} of order n. Γ(S) is an undirected graph whose vertices are the nonzero elements of S. It is a new graph type which is the dot product. k be finite positive integer for 0≤{it}t=1k,{jt}t=1k≤n, any two distinct vertices of S(xi1,xi2,…,xik) and (xj1,xj2,…,xjk) are adjacent if and only (xi1,xi2,…,xik)·(xj1,xj2,…,xjk)=0SMn (under the dot product) and it is assumed xit=0SMn if it=0.

Keywords: Dot product; Monogenic semigroups; Graph (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317307853
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:322:y:2018:i:c:p:1-5

DOI: 10.1016/j.amc.2017.11.012

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().