Results 61 to 70 of about 121,460 (194)
Planarity of Inclusion Graph of Cyclic Subgroups of Finite Group [PDF]
Mathematics Interdisciplinary Research, 2020 Let G be a finite group. The inclusion graph of cyclic subgroups of G, Ic(G), is the (undirected) graph with vertices of all cyclic subgroups of G, and two distinct cyclic subgroups ⟨a⟩ and ⟨b⟩, are adjacent if and only if ⟨a⟩ ⊂ ⟨b⟩ or ⟨b⟩ ⊂ ⟨a⟩. In this
Zahra Garibbolooki, Sayyed Heidar Jafari
doaj +1 more source
SpatialESD: Spatial Ensemble Domain Detection in Spatial Transcriptomics
Advanced Science, EarlyView.ABSTRACT Spatial transcriptomics (ST) measures gene expression while preserving spatial context within tissues. One of the key tasks in ST analysis is spatial domain detection, which remains challenging due to the complex structure of ST data and the varying performance of individual clustering methods. To address this, we propose SpatialESD, a Spatial
Hongyan Cao +11 more
wiley +1 more source
Some identities for enumerators of circulant graphs
, 2001 We establish analytically several new identities connecting enumerators of different types of circulant graphs of prime, twice prime and prime-squared orders.
Liskovets, Valery A.
core +1 more source
Flow-augmentation II: Undirected Graphs
ACM Transactions on AlgorithmsWe present an undirected version of the recently introduced flow-augmentation technique: Given an undirected multigraph G with distinguished vertices s,t ∈ V(G) and an integer k , one can in randomized k 𝒪(1) ⋅
Eun Jung Kim +3 more
openaire +3 more sources
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
MathematicsThe category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing that
Sebastian Pardo-Guerra +2 more
doaj +1 more source
Some new optimal and suboptimal infinite families of undirected double-loop networks
Discrete Mathematics & Theoretical Computer Science, 2006 Let n, s be positive integers such that 2≤s<n and s≠ n / 2. An undirected double-loop network G(n; 1, s) is an undirected graph (V, E), where V = ℤ n = {0, 1, 2, …, n-1 } and E = { (i, i+1 mod n), (i, i+s mod n) | i ∈ℤ}.
Bao Xing Chen +2 more
doaj
Hill Climbing-Based Efficient Model for Link Prediction in Undirected Graphs
Mathematics, 2022 Link prediction is a key problem in the field of undirected graph, and it can be used in a variety of contexts, including information retrieval and market analysis. By “undirected graphs”, we mean undirected complex networks in this study. The ability to
Haji Gul +4 more
doaj +1 more source
Bidirectional PageRank Estimation: From Average-Case to Worst-Case
, 2015 We present a new algorithm for estimating the Personalized PageRank (PPR) between a source and target node on undirected graphs, with sublinear running-time guarantees over the worst-case choice of source and target nodes.
B Bahmani +9 more
core +1 more source
Controllability of undirected graphs
Linear Algebra and its Applications, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander Farrugia, Irene Sciriha
openaire +2 more sources
Pool Compression for Undirected Graphs
IEEE Access, 2022 We present a new graph compression scheme that intrinsically exploits the similarity and locality of references in a graph by first ordering the nodes and then merging the contiguous adjacency lists of the graph into blocks to create a pool of nodes. The nodes in the adjacency lists of the graph are encoded by their position in the pool.
Muhammad Irfan Yousuf, Suhyun Kim
openaire +2 more sources