Ara
Toplam kayıt 7, listelenen: 1-7
Some notes on spectra of cographs
(Charles Babbage Res Ctr, 2011-07)
A cograph is a P-4-free graph. We first give a short proof of the fact that 0 (-1) belongs to the spectrum of a connected cograph (with at least two vertices) if and only if it contains duplicate (resp. coduplicate) vertices. ...
Dendrimers are the unique chemical trees with maximum spectral radius
(Univ Kragujevac, 2012)
It is shown that dendrimers have maximum spectral radius and maximum Collatz-Sinogowitz index among all chemical trees of given size. The result is also generalized for the class of chemical trees with prescribed number ...
Four-cycled graphs with topological applications
(Birkhauser Verlag AG, 2012-03)
We call a simple graph G a 4-cycled graph if either it has no edges or every edge of it is contained in an induced 4-cycle of G. Our interest on 4-cycled graphs is motivated by the fact that their clique complexes play an ...
Cryptanalysis of Fridrich's chaotic image encryption
(World Scientific Publishing, 2010-05)
We cryptanalyze Fridrich's chaotic image encryption algorithm. We show that the algebraic weaknesses of the algorithm make it vulnerable against chosen-ciphertext attacks. We propose an attack that reveals the secret ...
Semiregular trees with minimal Laplacian spectral radius
(Elsevier Inc, 2010-04-15)
A semiregular tree is a tree where all non-pendant vertices have the same degree. Among all semiregular trees with fixed order and degree, a graph with minimal (adjacency/Laplacian) spectral radius is a caterpillar. Counter ...
Graphs of given order and size and minimum algebraic connectivity
(Elsevier Science Inc, 2012-04-01)
The structure of connected graphs of given size and order that have minimal algebraic connectivity is investigated. It is shown that they must consist of a chain of cliques. Moreover, an upper bound for the number of maximal ...
Geometric representations and symmetries of graphs, maps and other discrete structures and applications in science
(Tübitak, 2015-09)
Bu proje çalışmasının birinci amacı çizgelerin özdeğer ve özvektör yapılarını çizge özellik ve sabitleri ile ilişkilendirmektir. İkinci amacı biyoloji, bioinformatik, dinamik sistemler, haberleşme, kriptoloji ve sosyal ...