Báo cáo toán học: "The Linear Complexity of a Graph" docx

... recoverable using any algorithm designed to compute the product of an adjacency matrix of the graph and an arbitrary vector. The linear complexity of a graph may therefore be seen as a measure of ... adjacency matrices of graphs, and a working knowledge of the linear complexity of a linear transformation. An excellent reference for linear complexity, and al...

Ngày tải lên: 07/08/2014, 13:21

... question of whether A has a similar property when s ≥ 2. Perhaps associated with some of the A sequences for s ≥ 2 is an integer m ≥ 2 such that for all i, j, k, | (A k+i A k )− (A j+i A j )|≤ m. Another ... c(n)isthe number of length n factors of F that can be followed by both a 0 and a 1 in F . Definition. Following standard terminology, define a factor w of F to b...

Ngày tải lên: 07/08/2014, 06:23

... graphs. Encyclopedia of Mathematics and its Applications, 66. Cambridge University Press, Cambridge, 1997. [4] N. Deo, F. Harary and A. J. Schwenk, An Eigenvector Characterization of Cospectral Graphs ... not Hamiltonian. For the second graph, take H = G. Again all the vertex-deleted subgraphs of both H and H are Hamiltonian, yet this time H is also Hamiltonian.” A different problem t...

Ngày tải lên: 07/08/2014, 06:20

... 05C83 Abstract The arc-representation of a graph is a mapping from the set of vertices to the arcs of a circle such that adjacent vertices are mapped to intersecting arcs. The width ofsucharepresentationisthemaximumnumberofarcshavingapointincommon. The ... set of arcs of a base circle, such that adjacent vertices of G are mapped to intersecting arcs. The width (in a repr...

Ngày tải lên: 07/08/2014, 06:22

... we consider a new zeta function of a graph G, and present another proof of Smilansky’s formula for some determinant on the bond scattering matrix of a graph by means of the Laplacian of G. Furthermore, ... 5 The Scattering Matrix of a Graph Hirobumi Mizuno Iond University, Tokyo, Japan Iwao Sato Oyama National College of Technology, Oyama, Tochigi 323-0806, Japan isato@o...

Ngày tải lên: 07/08/2014, 21:20

... University of Ljubljana, Jadranska 19, 1000 Ljubljana, Slovenia; Faculty of Natural Sciences and Mathematics, University of Maribor, Koroˇska 160, 2000 Maribor, Slove- nia; Institute of Mathematics, ... partial cubes [16, 37]. ∗ Faculty of Mathematics and Physics, University of Ljubljana, Jadranska 19, 1000 Ljubljana, Slove- nia; Institute of Mathematics, Physics and Mechanics,...

Ngày tải lên: 08/08/2014, 14:22

...

Ngày tải lên: 05/08/2014, 10:20

...

Ngày tải lên: 05/08/2014, 10:20

... itself a right translation of S if (ab)ρ = a( bρ) for all a, b ∈ S. A left translation λ and a right translation ρ of S are said to be linked if a( λb)= (a )b for all a, b ∈ S. In this case, we call ... investigated the translational hull of a type -A semigroup, in particular, the result obtained by Ault [1] was sub- stantially generalized and extended. Thus, the translatio...

Ngày tải lên: 06/08/2014, 05:20

... we know that the most typical examples of basic Hopf algebras of finite representation type are Taft algebras and the dual of A( n, d, μ, q), which as an associative algebra is generated by two ... algebra is a kind of generalization of gener- alized Taft algebra and of course Taft algebra. Therefore, it is natural to ask the following question: whether is the quantum double of...

Ngày tải lên: 06/08/2014, 05:20