Results 101 to 110 of about 27,298 (312)

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source

Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A balanced ( p , q ) $(p,q)$‐coloring of a signed graph ( G , σ ) $(G,\sigma )$ is an assignment of q $q$ colors to each vertex of G $G$ from a platter of p $p$ colors, such that each color class induces a balanced set (a set that does not induce a negative cycle).
Reza Naserasr, Lan Anh Pham, Cyril Pujol, Huan Zhou   +3 more
wiley   +1 more source

Subgraph-Aware Joint Modeling for Graph Classification via Efficient Frequent Pattern Mining and Fusion

IEEE Access
This paper proposes a subgraph-aware classification framework that integrates efficient frequent subgraph mining with graph neural networks (GNNs) to address the limitations of existing GNNs in capturing explicit local structures.
Weiyao Xu, Yumeng Sun, Yumeng MA, Yu Cheng, Jie Liu, Yuan Sheng, Yiwei Zhang, Junliang Du   +7 more
doaj   +1 more source

Scaling Up Subgraph Query Processing with Efficient Subgraph Matching

, 2019
A subgraph query finds all data graphs in a graph database each of which contains the given query graph. Existing work takes the indexing-filtering-verification (IFV) approach to first index all data graphs, then filter out some of them based on the ...
Qiong Luo, Sun, Shixuan, Luo, Qiong, Shixuan Sun   +3 more
core   +1 more source

Fractional List Packing for Layered Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

Modification and completion of geological structure knowledge graph based on pattern matching

Scientific Reports
As a knowledge representation method, knowledge graph is widely used in intelligent question answering systems and recommendation systems. At present, the research on knowledge graph mainly focuses on information query and retrieval based on knowledge ...
Cai Lu, Xinran Xu, Bingbin Zhang
doaj   +1 more source

Dynamic frequent subgraph mining algorithms over evolving graphs: a survey [PDF]

PeerJ Computer Science
Frequent subgraph mining (FSM) is an essential and challenging graph mining task used in several applications of the modern data science. Some of the FSM algorithms have the objective of finding all frequent subgraphs whereas some of the algorithms focus
Belgin Ergenç Bostanoğlu, Nourhan Abuzayed   +1 more
doaj   +2 more sources

A statistical mechanics description of environmental variability in metabolic networks

, 2014
Many of the chemical reactions that take place within a living cell are irreversible. Due to evolutionary pressures, the number of allowable reactions within these systems are highly constrained and thus the resulting metabolic networks display ...
Crofts, J.J., Crofts, JJ, Estrada, E, Estrada, Ernesto   +3 more
core   +1 more source

Halin's Grid Theorem for Digraphs

Journal of Graph Theory, EarlyView.
ABSTRACT Halin showed that every thick end of every graph contains an infinite grid. We extend Halin's theorem to digraphs. More precisely, we show that for every infinite family ℛ ${\rm{ {\mathcal R} }}$ of disjoint equivalent out‐rays there is a grid whose vertical rays are contained in ℛ ${\rm{ {\mathcal R} }}$.
Florian Reich
wiley   +1 more source

On Tight Tree‐Complete Hypergraph Ramsey Numbers

Journal of Graph Theory, EarlyView.
ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley   +1 more source