We know an undirected graph G = (V, e), where V = {V1, V2, V3, V4}, and its adjacency matrix is as follows

We know an undirected graph G = (V, e), where V = {V1, V2, V3, V4}, and its adjacency matrix is as follows

Adjacency table: V1: V2 - V3 - V4 V2: V1 - V3 - V4 V3: V1 - V2 V4: V1 - V2 depth traversal sequence: the corresponding spanning tree of V1 - V2 - V3 - V4 contains the following edges: E12, E24, E23 breadth traversal sequence: the corresponding spanning tree of V1 - V2 - V4 - V3 contains the following edges: E12, E14, E23

Let a = (α, V1, V2, V3), B = (β, V1, V2, V3), where α, β, V1, V2, V3 are all 4x1 matrices. Let | a | = 4, | B | = 1, find | ah, | a ^ t + B ^ T|

|A^T+B^T|
=|A+B|
= |α+β,2v1,2v2,2v3|
= 8 |α+β,v1,v2,v3|
= 8 (|α,v1,v2,v3|+|β,v1,v2,v3|)
= 8 (|A|+|B|)
= 8(4+1)
= 40

Construct the adjacency matrix, know a group of numbers, V1, V2, V3, V4, V5, know the relationship between each other (not necessarily all related), and construct the adjacency matrix
For example, V1 is related to V2, V4, V2 is related to V1, V3, V5, V3 is related to V2, V4, V5, V4 is related to V1, V3, V5 is related to V2, V3, construct adjacency matrix and draw undirected graph according to adjacency matrix

Given an undirected graph G = (V, e), where V = {V1, V2, V3, V4}, its adjacency matrix is as follows: 0 1V2 depth traversal sequence: V1 - V2 - V3 - V4, the corresponding spanning tree contains: E12,

The vertex of a digraph G is defined as v = {V 0, v 1, V 2, V 3}, if TD (V 0) = N 0, TD (v 1) = n 1, TD (V 2) = N 2, TD (V 3) = n 3
How many arcs are there in the graph

Because it is directed, there is a long arc when there is a degree
So the number should be N0 + N1 + N2 + N3