[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fHYJ34nEiDSXA9m0X3HK0E2llZYu4I4TWScWkSf5kYz0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":18,"related":19,"source":27,"type":28},[],"2025-11-18 19:09:24",1080038777,[8,9,10,11],"3","4","5","6",{"courseId":13,"courseImg":14,"courseName":15,"workId":16,"workName":17},"1000061051","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F028c9580f23ecd8fde218c4288ec2106.jpg","离散数学","62886133","第七章单元测试","一棵无向树T有8个顶点,4度、3度、2度的分枝点各1个,其余顶点均为树叶,则T中有( )片树叶",[20,29,38,46,55,64,73,82,91,94],{"answer":21,"createTime":5,"id":22,"options":23,"question":26,"source":27,"type":28},[],1080038703,[24,25,8,9],"1","2","在一棵树中有7片树叶,3个3度结点,其余都是4度结点则该树有( )个4度结点","v2",0,{"answer":30,"createTime":5,"id":31,"options":32,"question":37,"source":27,"type":28},[],1080038708,[33,34,35,36],"完全图","树","简单图","多重图或有环","设G=为无向图,|V|=7, |E|= 23, 则G一定是 ( )",{"answer":39,"createTime":5,"id":40,"options":41,"question":45,"source":27,"type":28},[],1080038733,[42,9,43,44],"10","8","12","设无向图有18条边且每个顶点的度数都为3,则图有( )个项点",{"answer":47,"createTime":5,"id":48,"options":49,"question":54,"source":27,"type":28},[],1080038739,[50,51,52,53],"m=n+1","n=m+1","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fa63e7e0498ddab1d73b02f30374e785f.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F773732df50faa3ce16c9551ebcae7ca7.png\">","设无向图\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd12ec98079be09c25dae265ecafe2c82.png\">是连通的且\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fbed785a286278f788324e477fb9a3430.png\"> 若( )则G是树",{"answer":56,"createTime":5,"id":57,"options":58,"question":63,"source":27,"type":28},[],1080038743,[59,60,61,62],"度数为偶数的结点","入度为奇数的结点","度数为奇数的结点","出度为奇数的结点","在任何图中必定有偶数个( )",{"answer":65,"createTime":5,"id":66,"options":67,"question":72,"source":27,"type":28},[],1080038767,[68,69,70,71],"m=n-1","G是连通的","G中无回路","删除G中任一条边后,G仍连通","无向图G(n, m)是树,则下列说法不正确的是( )",{"answer":74,"createTime":5,"id":75,"options":76,"question":81,"source":27,"type":28},[],1080038771,[77,78,79,80],"无回路的连通图","有n个结点,n-1条边的连通图","每对结点之间都有通路的图","连通但删去一条边则不连通的图","下列不一定是树的是( )",{"answer":83,"createTime":5,"id":84,"options":85,"question":90,"source":27,"type":28},[],1080038775,[86,87,88,89],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F4345c54efe39a5da43944a7cdf834248.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd507de8f44f1e493ba2c85dca39ed233.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9326b9515274dc9d00bd6b0906b91f6e.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fa9b84520d89e1022743d476815aba13e.png\">","下列图中( )是根树",{"answer":92,"createTime":5,"id":6,"options":93,"question":18,"source":27,"type":28},[],[8,9,10,11],{"answer":95,"createTime":5,"id":96,"options":97,"question":100,"source":27,"type":28},[],1080038803,[98,24,25,99],"0","无数","设G是一棵树,则G的生成树有( )棵"]