Results 31 to 40 of about 2,332,619 (281)
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
Graph Powers and Graph Homomorphisms [PDF]
The Electronic Journal of Combinatorics, 2010 In this paper, we investigate some basic properties of fractional powers. In this regard, we show that for any non-bipartite graph $G$ and positive rational numbers ${2r+1\over 2s+1} < {2p+1\over 2q+1}$, we have $G^{2r+1\over 2s+1} < G^{2p+1\over 2q+1}$. Next, we study the power thickness of $G$, that is, the supremum of rational numbers ${2r+
Hajiabolhassan, Hossein, Taherkhani, Ali
openaire +3 more sources
Graphs Cospectral with Kneser Graphs [PDF]
SSRN Electronic Journal, 2009 AMS Subject Classification ...
Haemers, W.H., Ramezani, F.
openaire +5 more sources
Periodic 2-graphs arising from subshifts [PDF]
, 2009 Higher-rank graphs were introduced by Kumjian and Pask to provide models for higher-rank Cuntz-Krieger algebras. In a previous paper, we constructed 2-graphs whose path spaces are rank-two subshifts of finite type, and showed that this construction ...
A. Weaver +3 more
core +3 more sources
International Journal of Foundations of Computer Science, 2008 Switching graphs are graphs that contain switches. A switch is a pair of edges that start in the same vertex and of which precisely one edge is enabled at any time. By using a Boolean function called a switch setting, the switches in a switching graph can be put in a fixed direction to obtain an ordinary graph.
Groote, J.F., Ploeger, B.
openaire +4 more sources
Forum of Mathematics, Sigma, 2019 An elastic graph is a graph with an elasticity associated to each edge. It may be viewed as a network made out of ideal rubber bands. If the rubber bands are stretched on a target space there is an elastic energy. We characterize when a homotopy class of maps from one elastic graph to another is loosening, that is, decreases this elastic energy for all
openaire +3 more sources
Proceedings of the ACM Multimedia 2017 Workshop on South African Academic Participation, 2017 We present a means of formulating and solving graph coloring problems with probabilistic graphical models. In contrast to the prevalent literature that uses factor graphs for this purpose, we instead approach it from a cluster graph perspective. Since there seems to be a lack of algorithms to automatically construct valid cluster graphs, we provide ...
Streicher, Simon, Preez, Johan du
openaire +2 more sources
Graph Isomorphism for unit square graphs [PDF]
, 2016 In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects.
Neuen, Daniel
core +2 more sources
Graph Filtering Over Expanding Graphs
2022 IEEE Data Science and Learning Workshop (DSLW), 2022 Our capacity to learn representations from data is related to our ability to design filters that can leverage their coupling with the underlying domain. Graph filters are one such tool for network data and have been used in a myriad of applications.
Das, Bishwadeep, Isufi, Elvin
openaire +2 more sources