About 2,510,000 results
Open links in new tab
  1. Graph theory: adjacency vs incident - Mathematics Stack Exchange

    Usually one speaks of adjacent vertices, but of incident edges. Two vertices are called adjacent if they are connected by an edge. Two edges are called incident, if they share a vertex. Also, a …

  2. How do you find the area of a parallelogram with the vertices?

    Oct 13, 2016 · How do you find the area of a parallelogram with the vertices? [closed] Ask Question Asked 8 years, 9 months ago Modified 6 years, 5 months ago

  3. Vertices of an equilateral triangle - Mathematics Stack Exchange

    Oct 9, 2013 · Question: show that the following three points in 3D space A = <-2,4,0>, B = <1,2,-1> C = <-1,1,2> form the vertices of an equilateral triangle. How do i approach this problem?

  4. Proving that the number of vertices of odd degree in any graph G …

    I'm having a bit of a trouble with the below question Given G G is an undirected graph, the degree of a vertex v v, denoted by deg(v) d e g (v), in graph G G is the number of neighbors of v v. …

  5. How many nonisomorphic directed simple graphs are there with

    Is a set of vertices all isolated included? (some solutions say yes, but how can it then be called 'directed?') The n n -vertex null digraph (i.e. n n vertices and no edges) is consistently …

  6. How many four-vertex graphs are there up to isomorphism;

    How many fundamentally different graphs are there on four vertices? This is a question on my homework. I'm thinking that I need to exhaust all the possible variations of a graph with four …

  7. Is a graph simple, given the number of vertices and the degree …

    Handshaking lemma: if the number of vertices with odd degrees is odd, it is not a simple graph. Order the degree sequence into descending order, like 3 2 2 1 Remove the leftmost degree: 2 …

  8. discrete mathematics - prove that a connected graph with $n

    Show that every connected graph with n n vertices has at least n − 1 n 1 edges. How can I prove this? Conceptually, I understand that the following graph has 3 vertices, and two edges: a-----b …

  9. Formulas for full m-ary trees - Mathematics Stack Exchange

    Feb 3, 2019 · I understand the theory, but some of the questions require memorizing several formulas for calculating the number of vertices, internal vertices, and leaves. The professor …

  10. Online tool for making graphs (vertices and edges)?

    Dec 11, 2010 · Anyone know of an online tool available for making graphs (as in graph theory - consisting of edges and vertices)? I have about 36 vertices and even more edges that I wish to …