𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Spectral Characterization of Some Generalized Odd Graphs

✍ Scribed by Tayuan Huang; Chao-Rong Liu

Publisher
Springer Japan
Year
1999
Tongue
English
Weight
144 KB
Volume
15
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Spectral characterization of some weight
Spectral characterization of some weighted rooted graphs with cliques
✍ Oscar Rojo; Luis Medina πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 349 KB

The level of a vertex in a rooted graph is one more than its distance from the root vertex. A generalized Bethe tree is a rooted tree in which vertices at the same level have the same degree. We characterize completely the eigenvalues of the Laplacian, signless Laplacian and adjacency matrices of a

Some results on odd factors of graphs
Some results on odd factors of graphs
✍ Cui Yuting; Mikio Kano πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 245 KB πŸ‘ 1 views
Spectral performance characterizations o
Spectral performance characterizations of some generalized median filters
✍ Steven R. Peterson; Yong Hoon Lee; Saleem A. Kassam πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 730 KB

Output correlations and power spectral densities are obtained for two types of generalized median jilters : the L-and M-jilters, ,for a sequence of independent, identically distributed inputs and also for a simple first-order Markov input sequence. The results show the ability of generalized median

Note: On the generalized spectral charac
Note: On the generalized spectral characterization of graphs having an isolated vertex
✍ Wei Wang; Cheng-Xian Xu πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 128 KB

In this paper, some sufficient conditions are given on a graph G, under which it is proved that G {x} is determined by the generalized spectrum iff G is determined by the generalized spectrum, where G {x} is the graph obtained from the graph G by adding an isolated vertex x.