399 views
0 votes
0 votes
Suppose A is a 12 by 9 incidence matrix from a connected (but unknown) graph with 9 nodes and 12 edges. The diagonal entries of $A^{T}.A$

give the number of edges into each node. Then, what is the sum of those diagonal entries ________.

1 Answer

Related questions

640
views
1 answers
0 votes
Ray Tomlinson asked Aug 9, 2023
640 views
Suppose we have a directed graph G = (V,E) with V= {1, 2, ..., n} and Eis presented as an adjacency list. For each vertex u in V, out(u) is a list such that (u, v) in {1, 2, ... k) ... (u), u in V?T(n) =O(n+m) B. T(n)= O(n(m+n))
971
views
3 answers
2 votes
srestha asked May 23, 2019
971 views
Consider a graph $G$ with $2^{n}$ vertices where the level of each vertex is a $n$ ... and number of connected component of $G$ for $n=8.$ The value of $x+10y$ is_____________