Draw a simple graph with four vertices Be sure to draw a picture

In essence, it is to find the non isomorphic spanning subgraphs of the complete graph K4 of order 4. There are 11
The method is to start with the number of edges and degrees. The number of edges can only be 0, 1, 2, 3, 4, 5, 6, and the degree of each vertex is between 0 and 3, so we can get the result
0 edges: 1
1 edge: 1
2 sides: 2
3 sides: 3
4 sides: 2
5 sides: 1
6 sides: 1

RELATED INFORMATIONS

1. The problem of set transitivity in discrete mathematics Let a = {a, B, C}, then the above relation R={,,,} S = {} is transitive Why are R and s transitive? Can r be understood as not meeting all the delivery possibilities?
2. Transitivity R1 = {(a, b), (B, c), (a, c)}, R1 is transitive, and R2 = {(a, b), (B, c), (a, c), (C, a)} is this transitive? That is, there can be no redundant ordered pairs that can be reused?
3. Judgment of reflexive antisymmetric transitivity X = {1,2,3,4}. If r = {(1,1) (2,3) (2,4) (3,4)} on X, then r has () A: Reflexivity B: anti reflexivity C: symmetry D: transitivity
4. Transitive relationship If the relation R is transitive on X, why is it arbitrary, What about ror? Please prove, I saw a question: Let R be a binary relation on set X, and prove that R is a transitive relation on X if and only if ror belongs to R. I see that the answer proves its necessity in one step: "if the relation R is a transitive relation on X, for any, "Ror", I just want to ask how this sentence is deduced,
5. In discrete mathematics, the definition of binary relation on set (a, B, c) and why it is transitive relation is related to their relation It doesn't match, it doesn't match the symmetry
6. How is the binary relation calculated? R1={(a,b),(c,d)},R2={(b,c),(d,e)} So R1 * R2 = {(a, c)}, R2 * R1 = {(B, d)} What do I think, R1 * R2 = {(a, c), (C, e)}, Because (a, b) (B, c) can get (a, c) (C, d) (D, e) can get (C, e)
7. Discrete mathematics problem, let R be a binary relation on a, define s = {(a, b) | &; C ∈ a, (a, c) ∈ R, (C, b) ∈ r}, prove Let R be a binary relation on a, define s = {(a, b) | &; C ∈ a, (a, c) ∈ R, (C, b) ∈ r}, prove that if R is an equivalence relation on a, then s is also an equivalence relation, and S = R It's OK to connect~
8. Matrix graphic transformation Let me ask a more professional question: when using matrix multiplication method to carry out graphic transformation, the order of each transformation matrix cannot be adjusted. However, how can I know which matrix is in the front and which matrix is in the back?
9. Why is the matrix representing the transformation always placed on the left side of the transformed matrix in matrix multiplication
10. What is the row exchange of a matrix?
11. How to deduce the discrete mathematics P → (P → q) P → q? And what is the value of P ∨ P, P ∧ p
12. On Discrete Mathematics p - > (Q - > P) The original question is like this Non p - > (P - > q) P - > (Q - > P) How is it proved?
13. What does P mean if and only if Q in discrete mathematics
14. On the problem of graph It is known that: "in a graph of order n, if there is a path from vertex u to vertex v (U is not equal to V), then there must be a primary path from u to V, and the length of the path is less than n-1." and "in a graph of order n, the length of any primary circuit is not greater than n." my question is: the primary path includes the primary circuit, so why is the length of any primary circuit not greater than N, rather than n-1 in a graph of order n?
15. Discrete mathematics problem map urgent! What is the difference between the complement of a subgraph relative to the original graph and the complement of a complete graph?
16. A certain element of hastu is not comparable with several elements of different layers. Which layer is it drawn on
17. The partial order relation on the set a = {2,3,6,12,24,36} is an integral division relation, which is to draw a Haas diagram. How to find Cova? Explain the specific lecture in detail
18. How to judge the maximum, minimum, maximum and minimum elements according to hastur's intuitionistic judgment, that is, a = {1,2 ·· 9}, R is the partial ordered set of integral division of A, Draw its hastur, and judge its maximum, minimum, maximum and minimum elements
19. Discrete mathematics graph Draw all possible directed simple graphs of three vertices with two edges, three edges and four edges respectively (assuming isomorphic graphs are indistinguishable)
20. Which of the following objects does hastow describe? A. Equivalence relation B. Partial order relation C. Digraph D. Undirected graph