𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On products and line graphs of signed graphs, their eigenvalues and energy

✍ Scribed by K.A. Germina; Shahul Hameed K; Thomas Zaslavsky

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
320 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Line graph eigenvalues and line energy o
Line graph eigenvalues and line energy of caterpillars
✍ Oscar Rojo πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 504 KB

The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d 3 and n Let C(p) be the caterpillar obtained from the stars S p 1 +1 , S p 2 +1 , . . . , S p d-1 +1

Net signs and eigenvalues of molecular g
Net signs and eigenvalues of molecular graphs: some analogies
✍ Ivan Gutman; Shyi-Long Lee; Yeong-Nan Yeh πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 377 KB

A number of analogies which exist between the net signs and the eigenvaiues of molecular graphs are pointed out. In particular, a pairing-theorem-type regularity holds for the net signs of bipartite graphs (i.e. molecular graphs of altemant hydrocarbons).

Enumeration of graphs with signed points
Enumeration of graphs with signed points and lines
✍ Frank Harary; Edgar M. Palmer; Robert W. Robinson; Allen J. Schwenk πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 485 KB

## Abstract Our object is to enumerate graphs in which the points or lines or both are assigned positive or negative signs. We also treat several associated problems for which these configurations are self‐dual with respect to sign change. We find that the solutions to all of these counting problem

On the embedding of graphs into graphs w
On the embedding of graphs into graphs with few eigenvalues
✍ Vu, Van H. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 726 KB

A graph is called of type k if it is connected, regular, and has k distinct eigenvalues. For example graphs of type 2 are the complete graphs, while those of type 3 are the strongly regular graphs. We prove that for any positive integer n, every graph can be embedded in n cospectral, non-isomorphic