Main Article Content
Abstract
In this work, we have made some modifications on the definition of the incidence matrices of a directed graph, to let the incidence matrices to be more confident for X – Labeled graphs. The new incidence matrices are called the incidence matrices of X – Labeled graphs, and we used the new definition to give a computer program for Nickolas`s Algorithm .
Keywords
Article Details
References
- ABDU, K.A. 1999. "Representing Core graphs and Nickolas`s Algorithm", M.Sc .Thesis, Baghdad University.
- LYNDON, R.C. and SCHUPP, P.E. 1977. " Combinatorial group theory", Ergebniss Vol. 89, Berlin – Heidelberg – New York, Springer.
- MAGNUSS, http://www.omansail.com/W, KARRASS, A. and SOLITER, D. : "Combinatorial group theory", New York. John wiley and sons Inc 1966.
- NICKOLAS, P. 1985. " Intersecton of finitely generated free groups", Bull. Austral. Math. Soc. 31: 339 – 349.
- SARVATIUS, B. 1983. "A short proof of a theorem of Burns", Math. 71: 551 – 565.
References
ABDU, K.A. 1999. "Representing Core graphs and Nickolas`s Algorithm", M.Sc .Thesis, Baghdad University.
LYNDON, R.C. and SCHUPP, P.E. 1977. " Combinatorial group theory", Ergebniss Vol. 89, Berlin – Heidelberg – New York, Springer.
MAGNUSS, http://www.omansail.com/W, KARRASS, A. and SOLITER, D. : "Combinatorial group theory", New York. John wiley and sons Inc 1966.
NICKOLAS, P. 1985. " Intersecton of finitely generated free groups", Bull. Austral. Math. Soc. 31: 339 – 349.
SARVATIUS, B. 1983. "A short proof of a theorem of Burns", Math. 71: 551 – 565.