Results 61 to 70 of about 63,637 (247)
Induced subgraphs of zero-divisor graphs
Discrete Mathematics, 2023 The zero-divisor graph of a finite commutative ring with unity is the graph whose vertex set is the set of zero-divisors in the ring, with $a$ and $b$ adjacent if $ab=0$. We show that the class of zero-divisor graphs is universal, in the sense that every finite graph is isomorphic to an induced subgraph of a zero-divisor graph.
G. Arunkumar +3 more
openaire +4 more sources
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs [PDF]
Journal of Graph Theory, 2020 AbstractFor a bipartite graph , let be the largest such that either contains , a complete bipartite subgraph with parts of size , or the bipartite complement of contains as a subgraph. For a class of graphs , let . We say that a bipartite graph is strongly acyclic if neither nor its bipartite complement contains a cycle. By we denote the set of
Maria Axenovich +2 more
openaire +4 more sources
In Situ Graph Reasoning and Knowledge Expansion Using Graph‐PRefLexOR
Advanced Intelligent Discovery, EarlyView.Graph‐PRefLexOR is a novel framework that enhances language models with in situ graph reasoning, symbolic abstraction, and recursive refinement. By integrating graph‐based representations into generative tasks, the approach enables interpretable, multistep reasoning.
Markus J. Buehler
wiley +1 more source
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams [PDF]
, 2015 While in many graph mining applications it is crucial to handle a stream of updates efficiently in terms of {\em both} time and space, not much was known about achieving such type of algorithm.
Epasto A. +4 more
core +3 more sources
Dense subgraphs induced by edge labels
Machine Learning, 2023 AbstractFinding densely connected groups of nodes in networks is a widely-used tool for analysis in graph mining. A popular choice for finding such groups is to find subgraphs with a high average degree. While useful, interpreting such subgraphs may be difficult.
Iiro Kumpulainen, Nikolaj Tatti
openaire +3 more sources
Advanced Intelligent Systems, EarlyView.R‐APEX is a knowledge graph platform developed to investigate how air pollutants such as particularly fine particulate matter (PM2.5) affect human health. By integrating large‐scale biomedical data and using machine learning, it reveals pollutant–gene–disease associations.
Zhixing Zhu +7 more
wiley +1 more source
Matched Filters for Noisy Induced Subgraph Detection [PDF]
, 2018 The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision.
Lyzinski, Vince +3 more
core +1 more source
Pure pairs. I. Trees and linear anticomplete pairs
, 2020 The Erdos-Hajnal Conjecture asserts that for every graph H there is a constant c > 0 such that every graph G that does not contain H as an induced subgraph has a clique or stable set of cardinality at least |G|^c.
Chudnovsky, Maria +3 more
core +1 more source
Motif-role-fingerprints: the building-blocks of motifs, clustering-coefficients and transitivities in directed networks. [PDF]
PLoS ONE, 2014 Complex networks are frequently characterized by metrics for which particular subgraphs are counted. One statistic from this category, which we refer to as motif-role fingerprints, differs from global subgraph counts in that the number of subgraphs in ...
Mark D McDonnell +5 more
doaj +1 more source
Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
, 2013 Bedrossian characterized all pairs of forbidden subgraphs for a 2-connected graph to be Hamiltonian. Instead of forbidding some induced subgraphs, we relax the conditions for graphs to be Hamiltonian by restricting Ore- and Fan-type degree conditions on ...
Bedrossian +13 more
core +1 more source