Results 221 to 230 of about 832,082 (275)
Spatiotemporal prediction of water quality and ecological risk assessment in a river basin using T-GCN based on river network topology constraints. [PDF]
Sci RepLi L.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Graph Theory, 1992
AbstractWe give a new condition involving degrees sufficient for a digraph to be hamiltonian.
openaire +2 more sources
AbstractWe give a new condition involving degrees sufficient for a digraph to be hamiltonian.
openaire +2 more sources
Directed Graphs and Substitutions
Theory of Computing Systems, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Holton, C., Zamboni, L. Q.
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 1999
A property \(P\) of graphs is called monotone if it is preserved under the deletion of edges. Let \(\Delta^P_n\) denote the simplicial complex whose simplices are edge sets of \(n\)-vertex graphs having a monotone property \(P\). Topological properties of complexes of undirected graphs recently have been studied in a number of papers (see references in
Björner, Anders, Welker, Volkmar
openaire +1 more source
A property \(P\) of graphs is called monotone if it is preserved under the deletion of edges. Let \(\Delta^P_n\) denote the simplicial complex whose simplices are edge sets of \(n\)-vertex graphs having a monotone property \(P\). Topological properties of complexes of undirected graphs recently have been studied in a number of papers (see references in
Björner, Anders, Welker, Volkmar
openaire +1 more source
SIAM Journal on Algebraic Discrete Methods, 1985
This very interesting paper introduces the concept of graceful directed graphs as follows. A digraph D with e arcs is numbered by assigning a distinct integer value h(v) from \(\{\) 0,1,...,e\(\}\) to each node v. Each arc (u,v) receives a value \(h(u,v)=h(v)-h(u)\) (mod e\(+1)\).
Bloom, G. S., Hsu, D. F.
openaire +1 more source
This very interesting paper introduces the concept of graceful directed graphs as follows. A digraph D with e arcs is numbered by assigning a distinct integer value h(v) from \(\{\) 0,1,...,e\(\}\) to each node v. Each arc (u,v) receives a value \(h(u,v)=h(v)-h(u)\) (mod e\(+1)\).
Bloom, G. S., Hsu, D. F.
openaire +1 more source
SIAM Journal on Discrete Mathematics, 1999
A ranking of a (di)graph is a colouring of the vertex set with positive integers in such a way that every (di)path between two vertices of the same colour has a vertex of larger colour. The \(k\)-ranking problem is as follows: given a (di)graph \(G\) and an integer \(k\), check whether \(G\) has a ranking with \(k\) colours. This problem is known to be
Kratochvíl, Jan, Tuza, Zsolt
openaire +2 more sources
A ranking of a (di)graph is a colouring of the vertex set with positive integers in such a way that every (di)path between two vertices of the same colour has a vertex of larger colour. The \(k\)-ranking problem is as follows: given a (di)graph \(G\) and an integer \(k\), check whether \(G\) has a ranking with \(k\) colours. This problem is known to be
Kratochvíl, Jan, Tuza, Zsolt
openaire +2 more sources
Decomposition of Directed Graphs
SIAM Journal on Algebraic Discrete Methods, 1982A composition for directed graphs which generalizes the substitution (or X-join) composition of graphs and digraphs, as well as the graph version of set-family composition, is described. It is proved that a general decomposition theory can be applied to the resulting digraph decomposition.
openaire +1 more source