vertices - graph
A collection of 13 pages on the topic 'vertices - graph'
Tags: graph, vertices, vertex, reachability, edge
Cage (graph theory) - Wikipedia
Known cages A degree-one graph has no cycle, and a connected degree-two graph has girth equal to its number of vertices, so cages are only of interest for r ? 3. The ( r ,3)-cage is a complete graph K
Tags: cage, girth, tutte, petersen, oeis
Circle graph - Wikipedia
Circle graph - Wikipedia, the free encyclopedia Circle graph From Wikipedia, the free encyclopedia Jump to: navigation , search In graph theory , a circle graph is a graph that has a representation as a collection of chords of a
Tags: chords, circle, intersect, overlap, interval
Degree (graph theory) - Wikipedia
Special cases of degree value 3.1 Isolated vertex 3.2 Leaf vertex 3.3 Regular graph 3.4 Source 3.5 Sink 3.6 Eulerian graph 3.7 Pseudoforest 4 Some theorems [ edit ] Undirected graphs A graph with 6 vertices and 7 edges For an undirected graph
Tags: outdegree, pseudoforest, deg, indegree, sink
Dominating set - Wikipedia
Dominating sets are closely related to independent sets : a maximal independent set in a graph is necessarily a minimal dominating set. However, dominating sets need not be independent, and there has been much work on connected dominating sets .
Tags: dominating, domination, hedetniemi, domatic, laskar
Glossary of graph theory - Wikipedia
Hamiltonian path for any given pair of (distinct) endvertices is a Hamiltonian connected graph . A graph that contains a Hamiltonian cycle is a Hamiltonian graph . A trail or circuit (or cycle) is Eulerian if it uses all edges precisely once. A graph that contains an Eulerian
Tags: endvertices, partite, reachable, adjacency, acyclic
Graph coloring - Wikipedia
Edge coloring Edges are colored List coloring Each vertex chooses from a list of colors List edge-coloring Each edge chooses from a list of colors Total coloring Vertices and edges are colored Harmonious coloring Every pair of colors appears on
Tags: chromatic, polynomial, color, planar, garey
Line graph - Wikipedia
Many of the following properties follow immediately from the standard way in which line graphs translate properties about edges in graphs to properties about vertices. The line graph of a connected graph is connected. The line graph of a bipartite graph is perfect (see König's theorem ). The edge chromatic number of a graph
Tags: beineke, brandstädt, roussopoulos, whitney, characterization
Random graph - Wikipedia
In mathematics , a random graph is a graph that is generated by some random process . The theory of random graphs lies at the intersection between graph theory and probability theory , and studies the properties of typical random graphs. Contents 1 Random graph models 2 Properties of random graphs
Tags: rényi, rgd, probability, percolation, dot
Reachability - Wikipedia
Reachability - Wikipedia, the free encyclopedia Reachability From Wikipedia, the free encyclopedia Jump to: navigation , search In graph theory , reachability is the notion of being able to get from one vertex in a directed graph to some other
Tags: reachability, connectivity, mathematics, pairs, ordered
Spanning tree (mathematics) - Wikipedia
Hamiltonian path problem ), the minimum diameter spanning tree, and the minimum dilation spanning tree. Contents 1 Spanning forests 2 Counting spanning trees 3 Uniform spanning trees 4 Algorithms 5 References [ edit ] Spanning forests A spanning forest is a type of subgraph
Tags: spanning, tree, edges, bfs, dfs
Strong coloring - Wikipedia
Strong coloring - Wikipedia, the free encyclopedia Strong coloring From Wikipedia, the free encyclopedia Jump to: navigation , search In graph theory , a strong coloring , with respect to a partition of the vertices into (disjoint) subsets of equal
Tags: alon, haxell, noga, colorable, chromatic
Belief propagation - Wikipedia
Contents 1 Exact algorithm for trees 2 Approximate algorithm for general graphs 3 Related algorithm and complexity issues 4 Relation to free energy 5 Generalized belief propagation (GBP) 6 References [ edit ] Exact algorithm for trees This algorithm functions
Tags: propagation, loopy, marginalization, marginal, belief
Graph (mathematics) - Wikipedia
Definitions 1.1 Graph 2 Types of graphs 2.1 Directed graph 2.2 Undirected graph 2.3 Finite graph 2.4 Simple graph 2.5 Regular graph 2.6 Weighted graph 2.7 Mixed graph 2.8 Complete graph 2.9 Variations in the definitions 2.10 Loop 2.10.1 Multiset
Tags: multigraph, planarity, zwillinger, undirected, loops