document.write( "Question 1163007: N,O,P,Q,R,S,T,U and edge set {{N,P},{N,U},{O,Q},{O,S},{O,T},{P,R},{P,U},{S,T},{S,U}} .\r
\n" ); document.write( "\n" ); document.write( "a. What is the degree of vertex Q ?
\n" ); document.write( "b. What is the degree of vertex U?
\n" ); document.write( "c. How many components does the graph have?
\n" ); document.write( "

Algebra.Com's Answer #786955 by ikleyn(52803)\"\" \"About 
You can put this solution on YOUR website!
.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "The correct answer to question  \"c\"  is   one component.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\r\n" );
document.write( "    In graph theory, a component, sometimes called a connected component, of an undirected graph is a subgraph in which \r\n" );
document.write( "    any two vertices are connected to each other by paths, and which is connected to no additional vertices in the supergraph.   \r\n" );
document.write( "    A graph that is itself connected has exactly one component, consisting of the whole graph.\r\n" );
document.write( "
\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "See this Wikipedia article\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "https://en.wikipedia.org/wiki/Component_(graph_theory)#:~:text=In%20graph%20theory%2C%20a%20component,additional%20vertices%20in%20the%20supergraph.&text=A%20vertex%20with%20no%20incident%20edges%20is%20itself%20a%20component.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );