Results 271 to 280 of about 397,867 (315)
Graph attention-driven relation network for 3D lane detection. [PDF]
Sci RepJiang Y +6 more
europepmc +1 more source
The complete picture of the Twitter social graph
, 2015 Maksym Gabielkov +7 more
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Complete (2,2) Bipartite Graphs
Malaysian Journal of Mathematical Sciences, 2022A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other. A (2,2) bipartite graph is an extension of the above concept in which no two vertices in the same part are at distance two from each other.
Hanif, S., Bhat, K. A., Sudhakara, G.
openaire +1 more source
Completely Disconnecting the Complete Graph
SIAM Journal on Discrete Mathematics, 2000Let \(\omega \in {\mathbb{N}} \cup \{\infty\}\). By ``completely disconnecting a graph \(G\)'' the authors mean a sequence \(G= G_0, G_1, \ldots, G_t\) of spanning subgraphs of \(G\) where \(G_t\) has no edge and \(G_{i+1}\) is obtained from \(G_i\) by deleting at most \(\omega\) edges with no more than one edge being deleted from any connected ...
Ginsburg, John, Sands, Bill
openaire +1 more source
Canadian Journal of Mathematics, 1967
In our paper “Magic graphs” (1) we showed that every complete graph Kn with n ⩾ 5 is “magic,” i.e., if the vertex set is indicated {vi} and if eij is the edge joining vi and vj, i ≠ j , then there exists a function α(eij) such that the set {α(eij)} consists of distinct positive rational integers and the vertex sums1have a constant value σ(α) for k = 1,
openaire +2 more sources
In our paper “Magic graphs” (1) we showed that every complete graph Kn with n ⩾ 5 is “magic,” i.e., if the vertex set is indicated {vi} and if eij is the edge joining vi and vj, i ≠ j , then there exists a function α(eij) such that the set {α(eij)} consists of distinct positive rational integers and the vertex sums1have a constant value σ(α) for k = 1,
openaire +2 more sources
2013
Let T 1, T 2,…, T k be spanning trees in a graph G. If for any two vertices x, y of G, the paths from x to y in T 1, T 2,…, T k are vertex-disjoint except end vertices x and y, then T 1, T 2,…, T k are called completely independent spanning trees in G. In 2001, Hasunuma gave a conjecture that there are k completely independent spanning trees in any 2k ...
Kung-Jui Pai +3 more
openaire +1 more source
Let T 1, T 2,…, T k be spanning trees in a graph G. If for any two vertices x, y of G, the paths from x to y in T 1, T 2,…, T k are vertex-disjoint except end vertices x and y, then T 1, T 2,…, T k are called completely independent spanning trees in G. In 2001, Hasunuma gave a conjecture that there are k completely independent spanning trees in any 2k ...
Kung-Jui Pai +3 more
openaire +1 more source
Complete multipartite decompositions of complete graphs and complete n-partite graphs
Applied Mathematics-A Journal of Chinese Universities, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Petersen Graph Decompositions of Complete Multipartite Graphs
Graphs and Combinatorics, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Jinhua, Ma, Dengju
openaire +2 more sources