Results 171 to 180 of about 1,017,247 (314)
Maximal energy bipartite graphs [PDF]
, 2003 Given a graph $G$, its energy $E(G)$ is defined to be the sum of the absolute values of the eigenvalues of $G$. This quantity is used in chemistry to approximate the total $\pi$-electron energy of molecules and in particular, in case $G$ is bipartite ...
Moulton, Vincent, Koolen, Jack H.
core +1 more source
Ethnic integration and the value of innovation
Strategic Management Journal, EarlyView.Abstract Research Summary Organizations have become increasingly ethnically diverse, and this diversity often brings together distinct technological competencies. Understanding how firms can leverage such diversity to produce valuable innovations therefore becomes essential.
Stefano Breschi +2 more
wiley +1 more source
Dual Bipartite Q-polynomial Distance-regular Graphs [PDF]
, 1996 We classify the dual bipartite Q-polynomial distance-regular graphs of diameterd≥5which are not bipartite. Results of Curtin and Nomura give a classification of the dual bipartite Q-polynomial distance-regular graphs of diameterd ≥6which are bipartite ...
Terwilliger, Paul M., Dickie, Garth A.
core +1 more source
Generating Compressed Counterfactual Hard Negative Samples for Graph Contrastive Learning
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Graph contrastive learning (GCL) relies on acquiring high‐quality positive and negative samples to learn the structural semantics of the input graph. Previous approaches typically sampled negative samples from the same training batch or an irrelevant external graph.
Haoran Yang +7 more
wiley +1 more source
Degeneracies of Triangulated Graphs
Theory and Applications of GraphsA graph $G$ is $k$-degenerate if each subgraph has minimum degree at most $k$. The degeneracy\textbf{ }$D\left(G\right)$ is the smallest $k$ such that $G$ is $k$-degenerate.
Allan Bickle
doaj +1 more source
A Generalized Information-Theoretic Approach for Bounding the Number of Independent Sets in Bipartite Graphs. [PDF]
Entropy (Basel), 2021 Sason I.
europepmc +1 more source
Bipartite graphs with at most six non-zero eigenvalues
Ars Math. Contemp., 2016 In this paper we characterize all bipartite graphs with at most six non-zero eigenvalues. We determine the eigenvalues of bipartite graphs that have at most four non-zero eigenvalues.
M. Oboudi
semanticscholar +1 more source
Characterizations of bipartite Steinhaus graphs [PDF]
, 1999 We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes.
Bhaskar DasGupta +13 more
core +1 more source
Boosting Embodied Visual Localisation Through Multi‐Granular Semantics and Multi‐Robot Consensus
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Achieving high accuracy and synergy remains extremely difficult for multi‐robot embodied visual localisation, which suffers from persistent real‐world challenges such as viewpoint ambiguity, appearance variation and dynamic occlusion. Conventional optimisation‐based methods often lead to incorrect feature matching without domain adaptation ...
Wenshuai Wang +4 more
wiley +1 more source
Fusion of KATZ measure and space projection to fast probe potential lncRNA-disease associations in bipartite graphs. [PDF]
PLoS One, 2021 Zhang Y +7 more
europepmc +1 more source