Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/28232| Title: | The Boolean power sequence of graphs |
| Authors: | Li Marzi, Enzo Maria Sciriha, Irene |
| Keywords: | Boolean matrices Mathematics -- Charts, diagrams, etc. Mathematics -- Problems, exercises, etc. Bipartite graphs |
| Issue Date: | 2004 |
| Publisher: | Mathematical Association of America |
| Citation: | Li Marzi, E. M., & Sciriha, I. (2004). The Boolean power sequence of graphs. Graph Theory Notes of New York, 46, 20-26. |
| Abstract: | The adjacency matrix A of a graph G is a 0-1 matrix. The Boolean power sequence of A is convergent or periodic of period p = 2: The index y of A is the least integer m such that Am = Am+1 if A converges and the least integer m such that Am = Am+2 if A is periodic. In this paper we determine the index y of A if the graph G is bipartite. In the case of non-bipartite connected graphs, we give new lower and upper bounds for y , which are sharp. |
| URI: | https://www.um.edu.mt/library/oar//handle/123456789/28232 |
| Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| The_Boolean_Power_Sequence_of_Graphs_2002.pdf | 155.63 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.