论文信息 - On Simply Structured Kernel Bases of Unicyclic Graphs

On Simply Structured Kernel Bases of Unicyclic Graphs

In this paper all those unicyclic graphs are characterized for which there exists a basis of the kernel that consists only of vectors with entries from { 1,0,1} . Three different characterizations are obtained, based on an algorithmic, an algebraic, and a structural criteria, respectively. Algorithmic construction of such bases is discussed as well.

Torsten Sander | T. Sander | J. W. Sander | J. Sander

[1] Rafael H. Villarreal,et al. Rees algebras of edge ideals , 1995 .

[2] S. Akbari,et al. {−1, 0, 1}-Basis for the null space of a forest , 2006 .

[3] Torsten Sander,et al. On Certain Eigenspaces of Cographs , 2008, Electron. J. Comb..

[4] Torsten Sander,et al. On Simply Structured Bases of Tree Kernels , 2005 .

[5] Irene Sciriha,et al. Nut graphs : maximally extending cores , 1998 .

[6] Irene Sciriha,et al. Minimal configurations and interlacing , 2005 .

[7] Dragoš Cvetković,et al. The algebraic multiplicity of the number zero in the spectrum of a bipartite graph , 1972 .

[8] Fumio Hazama,et al. On the kernels of the incidence matrices of graphs , 2002, Discret. Math..

[9] Irene Sciriha,et al. Trees with maximum nullity , 2005 .

[10] S. Akbari,et al. The kernels of the incidence matrices of graphs revisited , 2006 .

[11] Gordon F. Royle,et al. Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[12] N. Biggs. Algebraic Graph Theory: COLOURING PROBLEMS , 1974 .

[13] Stephen T. Hedetniemi,et al. Reducing the adjacency matrix of a tree , 1996 .