Báo cáo toán học: "Hyperbolicity and chordality of a graph" ppsx

... for the nonlinear deflection analysis of an infinite beam resting on a nonlinear elastic foundation under localized external loads. Although their method app ears powerful as a mathematical procedure ... eam resting on a both non-uniform and nonlinear elastic foundation by means of Banach fixed point theorem. In fact, this restriction on the candidate space...

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

... Synthesis and characterization of CuO nanowires by a simple wet chemical method Anita Sagadevan Ethiraj 1 and Dae Joon Kang* 1 1 BK21 Physics Research Division, Department of Energy ... Fully formatted PDF and full text (HTML) versions will be made available soon. Synthesis and characterization of CuO nanowires by a simple wet chemica...

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

... Communications and Networking 2011, 2011:187 http://jwcn.eurasipjournals.com/content/2011/1/187 Page 11 of 12 RESEARCH Open Access Analysis and modeling of spatial characteristics in urban microscenario of ... intra-cell interference, while the interference from the other sites is defined as inter-cell interference. The ratio of the intra-site interference to inter-...

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

... acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Existence and multiplicity of solutions for nonlocal p(x)-Laplacian equations with nonlinear Neumann boundary ... [33–37], and for the p(x)-Laplacian with non- linear boundary conditions see [38–40]. Motivated by above, we focus the case of nonlocal p(x)-Laplac...

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

... alt =""

Ngày tải lên: 05/08/2014, 15:21

Ngày tải lên: 05/08/2014, 15:21

... pp.15-33. The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements Elias M. Hagos emhagos@hotmail.com Submitted: ... vertex-deleted subgraphs of G is known as its deck. The characteristic polynomial of G is the characteristic polynomial o...

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

... number of switching classes it fixes is equal to the number of elements of B that it fixes. This number is easily computed, and in any case is known from the enumeration of switching classes of graphs by ... number of switching classes of tournaments is smaller than the number of switching classes of graphs if n ≥ 3. For the formula is a sum of some of...

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 ... width ofsucharepresentationisthemaximumnumberofarcshavingapointincommon. The arc-width( aw) of a graph is the minimum wid...

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

... conclude that any petal graph G, other than P ∗ , must be Class 1. the electronic journal of combinatorics 10 (2003), #R6 6 Colouring the petals of a graph David Cariolaro ∗ Department of Mathematics University ... Mathematics University of Reading RG6 6AX U.K. davidcariolaro@hotmail.com Gianfranco Cariolaro Dipartimento di Ingegneria dell’ Informazione Universit`adiPadova 35...

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

... large integers . Theorem 3.1. The graph G ì + contains -bundles for arbitrarily large integers .Inpar- ticular, for any positive integer , the graph G ì + contains subgraphs of the following type: n  n 1  S S S S S S S S S S S S S S S S S S S S S S S S  k k k k k k k k k k k k k k k k k k k k k k k k k k n 2  M M M M M M M M M M M M M M M M M  p p p p p p p p p p p p p...

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

... 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

... 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, ... The Scattering Matrix of a Graph Hirobumi Mizuno Iond University, Tokyo, Japan Iwao Sato Oyama National College of Technology, Oyama, Tochigi 323-0806, Japan i...

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

... It is easy to see that each cograph is distance-hereditary and all distance-hereditary graphs form a proper subclass of 4-chordal graphs. It is also known that cocomparability graphs are all 4-chordal ... triple (AT ) of a graph G is a a set of three vertices of G such that for any pair of them there is a path connecting the two vertices and having a distance at least...

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

... -dimensional Fibonacci cube. We give bounds on the Fibonacci dimension of a graph in terms of the isometric and lattice dimension, provide a combinatorial characterization of the Fibonacci dimension ... University of Ljubljana, Jadranska 19, 1000 Ljubljana, Slovenia; Faculty of Natural Sciences and Mathematics, University of Maribor, Koroˇska 160, 2000 Maribor, Slov...

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