论文信息 - Eigenvalues of some signed graphs with negative cliques

Eigenvalues of some signed graphs with negative cliques

In a signed graph G, a negative clique is a complete subgraph having negative edges only. In this article, we give characteristic polynomial expressions, and eigenvalues of some signed graphs having negative cliques. This includes signed cycle graph, signed path graph, a complete graph with disjoint negative cliques, and star block graph with negative cliques.

Ranveer Singh | Ravindra B. Bapat | R. Bapat | R. Singh

[1] Chris Arney,et al. Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[2] G. Walter,et al. Graphs and Matrices , 1999 .

[3] P. Sedgwick. Matching , 2009, BMJ : British Medical Journal.

[4] Jérôme Kunegis,et al. Applications of Structural Balance in Signed Social Networks , 2014, ArXiv.

[5] Marko Wagner,et al. A Combinatorial Approach To Matrix Theory And Its Applications , 2016 .

[6] F. Harary,et al. STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER'S THEORY1 , 1977 .

[7] Souvik Roy,et al. On the adjacency matrix of a block graph , 2014 .

[8] F. Heider. Attitudes and cognitive organization. , 1946, The Journal of psychology.

[9] Thomas Zaslavsky,et al. On products and line graphs of signed graphs, their eigenvalues and energy , 2010 .

[10] Frank Harary,et al. On the Spectrum of a Complete Multipartite Graph , 1980, Eur. J. Comb..

[11] F. Harary. On the notion of balance of a signed graph. , 1953 .

[12] B. Devadas Acharya. Spectral criterion for cycle balance in networks , 1980, J. Graph Theory.