User contributions for Scshunt
Jump to navigation
Jump to search
27 May 2016
- 16:5916:59, 27 May 2016 diff hist +341 Definition:Morphism Remark about a potentially confusing definition.
3 September 2014
1 September 2014
31 August 2014
- 05:4905:49, 31 August 2014 diff hist +349 N User:Scshunt/Incidence Function Defines Graph Created page with "== Theorem == Let $V, E$ be sets. Let $\phi : V \to E$ be a graph incidence function. Then there exi..." current
- 05:4405:44, 31 August 2014 diff hist +291 N User:Scshunt/Graph Defines Incidence Function Created page with "== Theorem == Let $G = \left({V, E}\right)$ be a Graph. Let $\phi$ be the User:Scshunt/Definition:Incidence Function of Graph|incidence..." current
- 05:4105:41, 31 August 2014 diff hist +13 m User:Scshunt/Definition:Incidence Function of Graph No edit summary
- 05:4005:40, 31 August 2014 diff hist 0 m User:Scshunt/Definition:Incidence Function of Graph No edit summary
- 05:4005:40, 31 August 2014 diff hist +11 m User:Scshunt/Definition:Incidence Function of Graph No edit summary
- 05:4005:40, 31 August 2014 diff hist +466 N User:Scshunt/Definition:Incidence Function of Graph Created page with "== Definition == Let $G = (V, E)$ be a graph. Then the '''incidence function of $G$''' is the function $\phi : V \times E \to \left\{{0,..."
- 05:3305:33, 31 August 2014 diff hist −6 m User:Scshunt/Definition:Graph Incidence Function →Formal Definition current
- 05:3305:33, 31 August 2014 diff hist +1 m User:Scshunt/Definition:Graph Incidence Function →Formal Definition
- 05:3205:32, 31 August 2014 diff hist +1,141 N User:Scshunt/Definition:Graph Incidence Function Created page with "== Informal Definition == An '''graph incidence function''' is, intuitively, any function which is the User:Scshunt/Definition:Incidence Function of Graph|incidence functio..."
13 August 2014
- 07:5507:55, 13 August 2014 diff hist −553 Definition:Graph (Graph Theory) →Formal Definition: Delete redundant text.
- 07:2907:29, 13 August 2014 diff hist +394 Definition talk:Graph (Graph Theory) No edit summary
12 August 2014
- 22:2922:29, 12 August 2014 diff hist +2,565 Definition talk:Graph (Graph Theory) →Refactor
- 22:0422:04, 12 August 2014 diff hist +878 N User:Scshunt/Definitions of Graph are Equivalent Created page with "== Theorem 1 == Let $G = \left(V, E\right)$ be a graph with edges as sets. Then there exists an incidence function $\phi : V..."
- 21:4521:45, 12 August 2014 diff hist +61 User:Scshunt/Definition:Graph →Equivalent Definitions current
- 21:4121:41, 12 August 2014 diff hist +2,807 N User:Scshunt/Definition:Graph Created page with "== Informal Definition == A '''graph''' is intuitively defined as a pair consisting of a set of '''nodes''' or '''vertices''' and a set of '''edges'''. File:ExampleOfGraph..."
5 August 2014
- 13:1813:18, 5 August 2014 diff hist −1 m Definition talk:Graph (Graph Theory) (oops, too many colons)
- 12:5012:50, 5 August 2014 diff hist +1,744 Definition talk:Graph (Graph Theory) →Refactor
- 09:0509:05, 5 August 2014 diff hist +1,248 Definition talk:Graph (Graph Theory) →Refactor
18 March 2012
- 22:3322:33, 18 March 2012 diff hist +396 Definition talk:Edge Contraction No edit summary current
17 March 2012
- 07:0107:01, 17 March 2012 diff hist +389 N Definition talk:Edge Contraction Created page with "A few notes here from my first draft: The notation for the vertex set of $H$ is a bit dense, but the other alternative is longer (since you need to handle the separate vertic..."
- 06:5906:59, 17 March 2012 diff hist +12 m Definition:Edge Contraction No edit summary
- 06:5706:57, 17 March 2012 diff hist +1,123 N Definition:Edge Contraction Created page with "==Definition== Let $G$ be an undirected graph. Let $e \in E\left({G}\right)$ be an edge of $G$. Then the..."
21 February 2012
- 04:2104:21, 21 February 2012 diff hist +327 User:Lord Farin/Sandbox →Graph Theory axiomatisation
- 04:1404:14, 21 February 2012 diff hist +7 m Definition:Vertex Cut →Also see
20 February 2012
- 17:2817:28, 20 February 2012 diff hist +27 Minimum Degree is at Least Connectivity No edit summary
- 17:2817:28, 20 February 2012 diff hist +1,585 N Minimum Degree is at Least Connectivity Created page with "== Theorem == Let $G = \left({V, E}\right)$ be a graph. Then: :$\delta\left({G}\right) \geq \kappa\left({G}\right)$ That is, the [[Definition:Minimum Degree|minimum degree..."
- 17:2817:28, 20 February 2012 diff hist +178 N Definition talk:Cut-Vertex Created page with "It is not strictly true that a cut-vertex is a vertex cut which is a singleton; it is rather a vertex, the singleton of which is a vertex cut. Any objections to me changing this?"
- 17:2517:25, 20 February 2012 diff hist +97 N File:MinimumDegreeisatLeastConnectivity.png An example to illustrate Minimum Degree is at Least Connectivity not producing a tight bound. current
- 17:1417:14, 20 February 2012 diff hist +74 Definition:Connectivity Add the degenerate case of <2 vertices, where G fails to satisfy even 1-connected-ness
- 16:5716:57, 20 February 2012 diff hist +9 m Definition:Neighborhood (Graph Theory) add the graph to the definition
- 16:4916:49, 20 February 2012 diff hist +55 m Definition:Neighborhood (Graph Theory) added category
- 16:4716:47, 20 February 2012 diff hist +107 Definition:Neighborhood (Analysis) Added graph theory definition
- 16:4616:46, 20 February 2012 diff hist +493 N Definition:Neighborhood (Graph Theory) Created page with "==Definition== <onlyinclude> Let $G = \left({V, E}\right)$ be a graph. Let $v \in V$ be a vertex of $..."
- 07:5107:51, 20 February 2012 diff hist +321 N Definition:Minimum Degree Created page with "== Definition == Let $G = \left({V, E}\right)$ be a graph. Then the '''minimum degreee''' of $G$ is $\delta\left({G}\right) = \min\left\{..."
- 07:2407:24, 20 February 2012 diff hist +57 m User talk:Lord Farin retroactive signature ahoy
- 07:1707:17, 20 February 2012 diff hist +1,076 Definition talk:Vertex Deletion No edit summary current
- 06:4906:49, 20 February 2012 diff hist +289 User talk:Lord Farin →Hi there... anything else I should know
18 February 2012
- 05:4505:45, 18 February 2012 diff hist 0 m Symbols:Abbreviations →BNF: add missing paren
- 05:4405:44, 18 February 2012 diff hist 0 m Definition:Vertex Cut →Example: somehow mismatched my delims in the final version
- 05:4305:43, 18 February 2012 diff hist +475 Definition:Vertex Cut Add a note about singletons and an example.
- 05:4205:42, 18 February 2012 diff hist +50 Definition:Component of Graph →Definition: Actually define component.
- 05:3405:34, 18 February 2012 diff hist +63 N File:Vertex-Cut.png A diagram to illustrate a vertex cut.
- 05:0805:08, 18 February 2012 diff hist −181 Definition:Cut-Vertex Use vertex set deletion, rather than deletion of the individual vertex, to reduce overloading of notation (not to mention ambiguity if using set-theoretic natural numbers as your vertices---is G - 2 removing the vertex 2 or the set {1, 0}?)
- 04:4604:46, 18 February 2012 diff hist +55 m Definition talk:Vertex Deletion signature
- 04:4504:45, 18 February 2012 diff hist +214 N Definition talk:Vertex Deletion Created page with "I don't understand the need for the explains tag; as written the definition only applies to undirected graphs. If we want to extend this definition, we can, but currently it's..."
17 February 2012
- 20:3220:32, 17 February 2012 diff hist −16 m Definition:Vertex Cut →Definition: Added link to vertex deletion.
- 20:3120:31, 17 February 2012 diff hist +690 N Definition:Vertex Deletion Add a new definition!