Results 141 to 150 of about 27,298 (312)
On subgraph relationships between graph products
Journal of Nigerian Society of Physical SciencesGraph products play an important role in graph theory by providing systematic methods for constructing complex graphs from simpler ones and by revealing structural relationships among different graph classes.
Jinta Jose, Ninu S. Lal, Bobin George
doaj +1 more source
Bulky Subgraphs of the Hypercube
European Journal of Combinatorics, 2000 Suppose \(Q\) is a \(d\)-dimensional hypercube on \(2^d\) vertices. The intersection of \(Q\) with one of the hyperplanes \(x_i= 0\) or \(x_i= 1\), \(i\in [1,2,\dots, d]\) is a \((d-1)\)-dimensional hypercube called a facet of \(Q\). A graph is bulky if it meets every facet of \(Q\) and is connected. An induced subgraph is said to be simple-majority if
openaire +2 more sources
Locally densest subgraph discovery
, 2015 © 2015 ACM. Mining dense subgraphs from a large graph is a fundamental graph mining task and can be widely applied in a variety of application domains such as network science, biology, graph database, web mining, graph compression, and micro-blogging ...
Qin, L +7 more
core +1 more source
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source
Tree Independence Number III. Thetas, Prisms and Stars
Journal of Graph Theory, EarlyView.ABSTRACT We prove that for every t ∈ N $t\in {\mathbb{N}}$ there exists τ = τ ( t ) ∈ N $\tau =\tau (t)\in {\mathbb{N}}$ such that every (theta, prism, K 1 , t ${K}_{1,t}$)‐free graph has tree independence number at most τ $\tau $ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky +2 more
wiley +1 more source
Materials Genome Engineering Advances, EarlyView.DeepSeek‐Lattice‐KG integrates a domain‐adapted 14B LLM with a Neo4j lattice knowledge graph distilled from 50,000 papers. It analyzes queries, retrieves supporting subgraphs, and generates grounded answers; on a 2100‐question, six‐domain benchmark, it achieves 94.8% accuracy.
Zhiyang Shu +6 more
wiley +1 more source
Accelerating Subgraph Matching Through Advanced Compression and Label Filtering
AlgorithmsEfficiently identifying subgraphs that match a given query graph within large-scale graphs has become a critical focus in both academic and industrial research.
Yanfeng Chai, Jiashu Li, Qiang Zhang
doaj +1 more source
Subgraph Covers: An Information-Theoretic Approach to Motif Analysis in Networks
Physical Review X, 2014 Many real-world networks contain a statistically surprising number of certain subgraphs, called network motifs. In the prevalent approach to motif analysis, network motifs are detected by comparing subgraph frequencies in the original network with a ...
Anatol E. Wegner
doaj +1 more source
High Relative Accuracy Computations With Covariance Matrices of Order Statistics
Mathematical Methods in the Applied Sciences, EarlyView.ABSTRACT In many statistical applications, numerical computations with covariance matrices need to be performed. The error made when performing such numerical computations increases with the condition number of the covariance matrix, which is related to the number of variables and the strength of the correlation between the variables. In a recent work,
Juan Baz +3 more
wiley +1 more source