Results 91 to 100 of about 1,017,247 (314)
Distributed Average Consensus Algorithms in d-Regular Bipartite Graphs: Comparative Study
Future Internet, 2023 Consensus-based data aggregation in d-regular bipartite graphs poses a challenging task for the scientific community since some of these algorithms diverge in this critical graph topology.
Martin Kenyeres, Jozef Kenyeres
doaj +1 more source
Advances in Applied Mathematics, 1999 Let \(R = K[t_1, \ldots , t_d]\) be the polynomial ring in \(d\) indeterminates over a field \(K\). If \(G\) is a bipartite graph on the vertex set \(\{ 1, \ldots , d \}\), define \(K[G]\) to be the subalgebra of \(R\) generated by all monomials \(t_i t_j\) such that \(\{ i,j \}\) is an edge of \(G\). It is shown that if every \(n\)-cycle \((n \geq 6)\)
Ohsugi, Hidefumi, Hibi, Takayuki
openaire +2 more sources
BIPARTITE STEINHAUS GRAPHS [PDF]
Taiwanese Journal of Mathematics, 1999 A Steinhaus matrix is a symmetric 0-1 matrix \([a_{i,j}]_{n\times n}\) such that \(a_{i,j}= 0\) for \(0\leq i\leq n-1\) and \(a_{i,j}\equiv (a_{i- 1,j-1}+ a_{i-1,j})\pmod 2\) for \(1\leq i\leq n-1\). A Steinhaus graph is a graph whose adjacency matrix is a Steinhaus matrix. In this paper Lee and Chang prove that if \(G\) is a Steinhaus graph of order \(
Lee, Yueh-Shin, Chang, G. J.
openaire +3 more sources
On the approximability of the maximum induced matching problem [PDF]
, 2005 In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio <i>d</i>-1 for MIM in <i>d</i>-regular graphs, for each <i>d ...
Zito, Michele +12 more
core +1 more source
Materials Representation Learning Based on a Material–Motif Network and Heterogeneous Graphs
Advanced Intelligent Discovery, EarlyView.Structure motifs in materials are used to construct a bipartite material–motif network that links each material to its constituent motifs and establishes connectivity among materials sharing common motifs. Network analysis reveals material clusters associated with different functional applications and supports motif‐guided screening of materials.
Anoj Aryal +3 more
wiley +1 more source
Measuring and modeling bipartite graphs with community structure [PDF]
J. Complex Networks, 2016 Network science is a powerful tool for analyzing complex systems in fields ranging from sociology to engineering to biology. This paper is focused on generative models of large-scale bipartite graphs, also known as two-way graphs or two-mode networks. We
Sinan G. Aksoy, T. Kolda, Ali Pinar
semanticscholar +1 more source
Non-bipartite graphs of small Mahler measure [PDF]
, 2013 We classify all non-bipartite graphs that have Mahler measurebelow12(1 +√5). (The bipartite case was covered in an earlier paper by thesecond and third authors.
McKee, James, Smyth, Christopher
core
On bipartite powers of bigraphs [PDF]
, 2012 The notion of graph powers is a well-studied topic in graph theory and its applications. In this paper、 we investigate abipartite analogue of graph powers、 which we call bipartite powers of bigraphs.
Yota Otachi +5 more
core +1 more source
In‐Memory Continuous‐Time SAT Solver Based on Bidirectional 11‐T SRAM Macro
Advanced Intelligent Systems, EarlyView.This article reported a continuous‐time (CT) Boolean satisfiability (SAT) problem solver using bidirectional 11T‐SRAM macro. The proposed system operates asynchronously using capacitor‐based gradient integration and maximizes the parallelism for SAT solving by in‐memory computing (IMC).
Dongseok Kwon +3 more
wiley +1 more source
Bicyclic molecular graphs with the greatest energy [PDF]
Journal of the Serbian Chemical Society, 2008 The molecular graph Qn is obtained by attaching hexagons to the end vertices of the path graph Pn-12. Earlier empirical studies indicated that Qn has greatest energy among all bicyclic n-vertex (molecular) graphs.
IVAN GUTMAN +2 more
doaj +3 more sources