Показати простий запис статті

dc.contributor.author Dinesh, T.
dc.contributor.author Ramakrishnan, T.V.
dc.date.accessioned 2019-06-09T17:13:28Z
dc.date.available 2019-06-09T17:13:28Z
dc.date.issued 2013
dc.identifier.citation Labelling matrices and index matrices of a graph structure / T. Dinesh, T. V. Ramakrishnan // Algebra and Discrete Mathematics. — 2013. — Vol. 16, № 1. — С. 42–60. — Бібліогр.: 12 назв. — англ. uk_UA
dc.identifier.issn 1726-3255
dc.identifier.other 2010 MSC:05C07,05C78.
dc.identifier.uri http://dspace.nbuv.gov.ua/handle/123456789/152307
dc.description.abstract The concept of graph structure was introduced by E. Sampathkumar in 'Generalised Graph Structures', Bull. Kerala Math. Assoc., Vol 3, No.2, Dec 2006, 65-123. Based on the works of Brouwer, Doob and Stewart, R.H. Jeurissen has ('The Incidence Matrix and Labelings of a Graph', J. Combin. Theory, Ser. B30 (1981), 290-301) proved that the collection of all admissible index vectors and the collection of all labellings for 0 form free F-modules (F is a commutative ring). We have obtained similar results on graph structures in a previous paper. In the present paper, we introduce labelling matrices and index matrices of graph structures and prove that the collection of all admissible index matrices and the collection of all labelling matrices for 0 form free F-modules. We also find their ranks in various cases of bipartition and char F (equal to 2 and not equal to 2). uk_UA
dc.language.iso en uk_UA
dc.publisher Інститут прикладної математики і механіки НАН України uk_UA
dc.relation.ispartof Algebra and Discrete Mathematics
dc.title Labelling matrices and index matrices of a graph structure uk_UA
dc.type Article uk_UA
dc.status published earlier uk_UA


Файли у цій статті

Ця стаття з'являється у наступних колекціях

Показати простий запис статті

Пошук


Розширений пошук

Перегляд

Мій обліковий запис