Talk:Degree (graph theory)

Image:Depth-first-tree[edit]

Someone needs to fix the graph with the caption "An undirected graph with leaf nodes 4, 5, 6, 7, 10, 11, and 12". Node 10 is depicted as "18" in the graph. Figs 19:57, 14 March 2007 (UTC)[reply]

No its not. The zero just got a dot in it that makes i look like 18 if you dont look carefully. :) —Preceding unsigned comment added by 129.16.25.17 (talk) 11:23, 13 March 2008 (UTC)[reply]

Degree sum formula[edit]

I'm boldly redirecting Degree sum formula (present version) to this article, since it has been a stub for two years now and its content is already here. Melchoir (talk) 05:03, 22 March 2008 (UTC)[reply]

[edit] Graph (degree)[edit]

I'm still working on it. It will take a few days to complete. Thanks.

Is hangon code ok? --Tangi-tamma (talk) 11:12, 19 April 2008 (UTC)

No, the hangon tag is inappropriate - if you read its text, you will see that it refers specifically to a speedy deletion proposal. I suggest you remove it. {3,3,3,1} is a bad example of a sequence that is not a degree sequence, because there is a graph with this degree sequence - it is just not a simple graph. As the example comes immediately after presenting the degree sum formula, a sequence like {3,3,1} that clearly breaks this rule is a much better example. Gandalf61 (talk) 11:28, 19 April 2008 (UTC) We are talking here simple graphs (no loops, no multiple edges - read it carefully. It comes under the heading undirecteed (no loops, no multiple edges.). There is no graph with (3, 3, 3, 1), yes there is one with this if you consider graphs with loops or multiple edges; I do not find charm with degree sequences of graphs with loops or multiple edges (it is trivial). I'm writing for simple graphs.

If you do not like it, I will stop writing this article.

Let me know what code you are suggesting.

--Tangi-tamma (talk) 12:52, 19 April 2008 (UTC)

Retrieved from "http://en.wikipedia.org/wiki/User_talk:Gandalf61"

--Tangi-tamma (talk) 14:11, 19 April 2008 (UTC) Let me know what code you are suggesting.[reply]

--Tangi-tamma (talk) 12:52, 19 April 2008 (UTC)[reply]

The graph theory literature is, unfortunately, not consistent in its definitions. Sometimes the term "graph" implies a simple graph, sometimes it is used to mean a graph that may have multiple edges, or loops, or both.

When illustrating a statement such as "not every sequence is the degree sequence of a graph" it is best to use an example that is as simple as possible. It is not obvious that there is no (simple) graph with degree sequence {3,3,3,1}. It is more obvious, once the degree sum formula is known, that there can be no graph with degree sequence {3,3,1}. My example is simpler and therefore better.

Yes, I would prefer you to stop editing the Degree (graph theory) article. Your edits are often confusing, and sometimes wrong. Gandalf61 (talk) 15:09, 19 April 2008 (UTC)[reply]

You wrote ":The graph theory literature is, unfortunately, not consistent in its definitions". I think you need to work on fixing the connfusion for the article that somone wrote here. I'm not understanding what you are trying to influence? I want someone to intrevene here. You are pointing here at everybody including me when you are failing to understand the subject. The degree sequence that I'm talking here is for graphs without loops and multiple edges. Let me know what was confusing for you on this article. I'm setting the article for cleanup. --Tangi-tamma (talk) 17:02, 19 April 2008 (UTC)[reply]

Fine, I'll intervene; I agree with Gandalf61. This is not to say that simple graphs should not be discussed at all, but they come later in the logical progression. Melchoir (talk) 19:46, 19 April 2008 (UTC)[reply]

A baby example was given. Updated with a solid example. Also updated the definition of simple graphs to avoid confusion. Thanks God someone tried to understand the material. --Tangi-tamma (talk) 21:45, 19 April 2008 (UTC)[reply]

I'm not really comfortable with that characterization of the situation... anyway, there's some more cleanup that I'll do. Melchoir (talk) 02:19, 22 April 2008 (UTC)[reply]

I recommend changing the title "Degree (Graph theory)" to one of the followings[edit]

1. Degree sequence.

2. Degree sequence of graphs and hypergraphs.

Degree sequence is itself pretty big. The Graph (mathematics) covers the basic definitions of graphs. --Tangi-tamma (talk) 13:41, 20 April 2008 (UTC)[reply]

Oppose. "Degree sequence" is already re-directed here. "Degree sequence of graphs and hypergraphs" is not likely to be a search term. Leave title as is. Gandalf61 (talk) 16:48, 20 April 2008 (UTC)[reply]

How about changing it to "Degree sequence" rather than calling it as "Degree (Graph Theory)"? That does not sound good. --Tangi-tamma (talk) 18:54, 20 April 2008 (UTC)[reply]

This article is not only about degree sequences. Renaming it to "Degree sequence" would suggest that all degree-related data in a graph can be derived from its degree sequence, which is not the case. If "Degree (graph theory)" is really that unpalatable, then an equivalent title without parentheses would be "Degree of a vertex". Melchoir (talk) 02:16, 22 April 2008 (UTC)[reply]

Degree is a very important concept in graph theory, and lots of articles link here. We need to keep this article. Degree sequences may fit in as a subsection (my preference), or perhaps as an article on their own. Radagast3 (talk) 06:23, 1 May 2008 (UTC)[reply]

Undirected graph[edit]

The para needs editing using the math symbols. --Tangi-tamma (talk) 20:29, 20 April 2008 (UTC)[reply]

Removed section[edit]

I removed the following new section of text from the article:

Let P be any property that goes with a graph. Crispin St. J. A. Nash-Williams called a graphic degree sequence a Potentially P if the graphic degree sequence has at least one realization with property P. He called a Forcibly P if every realization of the graphic degree sequence has that property P. These concepts set forth a series of open research problems in degree sequence.

The sequence (13, 12, 11, 10, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2) on 14 vertices is an example of a forcibly Hamiltonian graphic sequence. The sequence (2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2) is an example of a potentially Hamiltonian graphic sequence. The problem of characterization of forcibly Hamiltonian graphic degree sequences is a classical open problem.

Removed because: 1) It is badly written and barely coherent. 2) As it appears to be talking about an open problem concerning Hamiltonian graphs, it does not belong in this article anyway. Gandalf61 (talk) 08:21, 21 April 2008 (UTC)[reply]

I would say agian that this is someone's ability to understand. --Tangi-tamma (talk) 13:15, 21 April 2008 (UTC)[reply]

I have dropped the idea of writing about degree sequences in detail. Let us make a deal here.

The deal is who cares about Forcibly.......from Williams.

We will just add the line : The sequence (13, 12, 11, 10, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2) of 14 vertices is an example of a Hamiltonian graphic degree sequence. (If you and Consensus do not feel comfortable, you may delete it.). --Tangi-tamma (talk) 22:55, 21 April 2008 (UTC)[reply]

I don't see the point of that sentence. The sequence (2, 2, 2) is also the degree sequence of a Hamiltonian graph, but who cares? Melchoir (talk) 02:30, 22 April 2008 (UTC)[reply]

0.25 [edit]

It is better to remove the portion when someone plays with rm. Since I do not have the citation, I cannot give it at this time. I will place the section here for future use if someone is able to get the reference.

The verification is as simple as understnding the simple graphs. Sosmeone could verify it easily. I cannot post the code that gets that number stated there.

Here is the piece.

Let $p$ be any positive even integer. Let $P$ ( $p$ ) denote the set of all partitions of $p$ . A partition in P( $p$ ) is graphical if it is the degree sequence of some simple graph. For example, (5,4, 4, 2, 2, 1) is not graphical. Let $G(p)$ denote the set of all graphical partitions of $p$ . The computation of | $G(p)$ | can be done in O(p⁴). For $p=50$ , | $G(p)$ | = 76104 and | $P(p)$ | = 204,226. Thus the ratio | $G(p)$ | to | $P(p)$ | tends to 0.25 as p tends infinity.^{[citation needed]}

Also notice that some said about Erdos paper, but he/she forgot to cite. How about this? --Tangi-tamma (talk) 13:15, 21 April 2008 (UTC)[reply]

If you mean my edits, I could cite them to some random book found on Google, as could any reader very quickly. As long as the material isn't being challenged, I'd prefer if someone took the time to find a really good reference, preferably a review article. Melchoir (talk) 02:33, 22 April 2008 (UTC)[reply]

Loops[edit]

I changed the appearance of loops in the header. Previously it claimed that "the number of edges incident to the vertex" implies that loops contribute 2, but that is not correct as a loop is only one edge. To explain this better, can someone please modify the figure to add a loop on vertex 1? (I can't edit SVG files.) Then we can have an extra sentence something like "The degree of vertex 1 in the figure is 3, since the loop contributes 2." McKay (talk) 01:18, 10 April 2009 (UTC)[reply]

Article misuses "multigraph"[edit]

This article misuses the term "multigraph" (or at least uses it in a way that will mislead many readers). Customarily, a multigraph may have more than one connection between the same two vertices. This is orthogonal to whether self-loops are allowed.

This article even shows an illustration, labelled a "multigraph", which only has self-loops, but not multi-edges. It also makes statements that are valid only if self-loops are allowed, but invalid for self-loop-free graphs with multi-edges. — Preceding unsigned comment added by 2A02:2454:8920:8700:997:DE8B:4887:1FA8 (talk) 14:00, 6 July 2020 (UTC)[reply]

You are right. Corrected the caption. You could have done this yourself.--Bill Cherowitzo (talk) 19:05, 6 July 2020 (UTC)[reply]