Graph theory Definition and 156 Threads

  1. Reshma

    Proving Non-Trivial Trees Have At Least 2 Vertices with Degree <2

    I'm not sure where to post this, but anyway here is the question: Given a graph G(p,q) is a tree where p is the number of vertices and q is the number of edges. Since given graph is a tree, number of edges q=p-1. How do you prove that every non-trivial tree has atleast two vertices with...
  2. N

    Help! I'm Struggling with Graph Theory Exam!

    I'm having an exam on graph theory next week and I'm having some problem with understanding the meaning of calculating eigenvalues of adjacency matrices for graphs. My notes suck from the lectures and I'm totally lost... Our professor asked "What is the sum of elements in row k of the...
  3. W

    Graph Theory: Dijkstra's Algorithm

    Hello, Does anyone know of an online resource which explains Dijkstra's Algorithm both in tabular form and graphical form? My text does an incredibly poor job explaining this algorithm. I sort of understand it graphically. But I have absolutely no idea what is going on when it comes to...
  4. W

    Intro Graph Theory: Components Connectivity

    Hello, I am having trouble understanding the definition of components and connectivity. Here is the definition I have been given in my text: Alright, I know that a subgraph is a subset of vertices and edges which itself forms a graph. I also know that a path is a subgraph in which no edge...
  5. W

    What are the definitions of graph theory and its components?

    Hello, My discrete math course has begun a section on graph theory. And I am hung up on some of the definitions. If someone is familiar with graph theory, I would appreciate it if some of these definitions could be reworded in another way. I will post the definitions we have taken so far and...
  6. V

    Can Greedy Coloring on Chordal Graph Complements Be Proven Optimal?

    does anyone have an idea on proving that there is a triangle-free k-chromatic graph for every positive integer k? or, how to prove that given a simplicial ordering on a chordal graph G, running the greedy coloring algorithm on the reverse order gives the optimal coloring on the complement...
Back
Top