Results 31 to 40 of about 1,080,603 (189)
MATEC Web of Conferences, 2017 In architectural and construction system “Monofant” a self-supporting skeleton consisting of a spatial curvilinear framework and unrecoverable hollow-core inserts made of expanded polystyrene was used to erect buildings and structures of curved shapes ...
Bugayevskiy Sergey +3 more
doaj +1 more source
Open Distance-Pattern Uniform Graphs [PDF]
, 2009 All graphs considered in this paper are finite, simple, undirected and connected. For graph theoretic terminology we refer to Harary [6].
Jose, Bibin K.
core +1 more source
Journal of Graph Algorithms and Applications, 2005 Summary: The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality.
Paul Holleis +2 more
openaire +1 more source
Smarandachely t-path step signed graphs [PDF]
, 2010 Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed ...
Reddy, Siva Kota +5 more
core +1 more source
Sequences on Graphs with Symmetries [PDF]
, 2011 An interesting symmetry on multiplication of numbers found by Prof.Smarandache recently. By considering integers or elements in groups on graphs, we extend this symmetry on graphs and find geometrical symmetries.
Mao, Linfan, Linfan Mao
core +1 more source
The graphs cospectral with the pineapple graph
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hatice Topcu +2 more
openaire +2 more sources
, 2000 We consider the equivalence classes of graphs induced by the unsigned versions of the Reidemeister moves on knot diagrams. Any graph which is reducible by some finite sequence of these moves, to a graph with no edges is called a knot graph.
Welsh, D J A +13 more
core +1 more source
Concepts and Practice of Statistics: Part 3 - Graphics
Australasian Orthodontic Journal, 1987 The process of analysis of a set data aims to detect patterns, especially relationships between variables, in the data. Statistical techniques can be described broadly as techniques to detect particular types of patterns, and to test whether such ...
McLean Alan L.
doaj +1 more source
Testing first-order properties for subclasses of sparse graphs [PDF]
, 2013 We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nešetřil and Ossona de Mendez.
Thomas, Robin +2 more
core +1 more source
Walk entropies on graphs [PDF]
, 2014 Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green’s function of a graph also known as the communicability. The walk entropies are strongly
Estrada, Ernesto +2 more
core +4 more sources