Nullity of t-Tupple Graphs

Authors: Khidir R. Sharaf, Didar A. Ali

Abstract:

The nullity η(G) of a graph is the occurrence of zero as an eigenvalue in its spectra. A zero-sum weighting of a graph G is real valued function, say f from vertices of G to the set of real numbers, provided that for each vertex of G the summation of the weights f(w) over all neighborhood w of v is zero for each v in G.A high zero-sum weighting of G is one that uses maximum number of non-zero independent variables. If G is graph with an end vertex, and if H is an induced subgraph of G obtained by deleting this vertex together with the vertex adjacent to it, then, η(G)= η(H). In this paper, a high zero-sum weighting technique and the endvertex procedure are applied to evaluate the nullity of t-tupple and generalized t-tupple graphs are derived  and determined for some special types of graphs,

 Also, we introduce and prove some important results about the t-tupple coalescence, Cartesian and Kronecker products of nut graphs.

Keywords: Graph theory, Graph spectra, Nullity of graphs.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1090829

References:

[1] L.W. Beineke, R. J. Wilson and P.J Cameron, Topics in Algebraic Graph Theory, Cambridge University Press, 2005.
[2] M. Brown, J. W. Kennedy and B. Servatius, Graph singularity, Graph Theory Notes of New York, XXV, 1993, pp.23-32.
[3] D. M. Cvetkovic, M. Doob and H. Sachs, Spectra of Graphs-Theory and Application, Academic Press, New York, 1979.
[4] D. M. Cvetkovic, M. Doob, I. Gutman and Torgasev, Recent Results in the Theory of Graph Spectra, North-Holland. Amsterdam, 1988.
[5] D.H. Mohammed, On the Degree of Singularity of Some Compound Graphs, M.Sc. Thesis, Duhok University, Duhok. 2005.
[6] P.A Rashid, Characterization for the Degree of the Singularity of a Graph, M.Sc. Thesis, Salahuddin University, Arbil, 2001.
[7] I. Sciriha, Coalesced and embedded nut graphs in singular graphs, Ars MathematicaContemporanea, Vol.1, 2008, pp.20-31.
[8] Y. Shibata and Y. Kikuchi, Graph products based on the distance in graphs, IEIC- E Trans. Fundamentals, Vol. E83- A, No. 3, 2000, pp.459-464