mikeem em's Bookmarks tagged chinese → View Popular

You are here: Diigo Home > mikeem em's Bookmarks

Expand All 1 - 4 of 4

YouTube - Russell Peters: Chinese Languages

Tags: youtube, funny, chinese, russell, peters on 2008-07-16 -All Annotations (0) -About

more fromwww.youtube.com

iComment: Be Heard

Tags: accent, chinese, dublinese, funny on 2008-01-07 -All Annotations (0) -About

more fromwww.icomment.org

5Expand

THE CHINESE POSTMAN PROBLEM - HOW CAN WE TELL WHETHER THERE WILL BE A SOLUTION

Tags: chinese, maths, postman on 2007-12-16 -All Annotations (0) -About

in list: Mathsmodels

more frompeople.bath.ac.uk

Basically, if all vertices in a graph are of an even order, then for any path the goes into a given vertex (excluding the one from which the path started), there will exist a continuation of the path leading out of the vertex.
Basically, if all vertices in a graph are of an even order, then for any path the goes into a given vertex (excluding the one from which the path started), there will exist a continuation of the path leading out of the vertex. Therefore, it will be possible to find a circuit through the network in which every edge is included, by selective choice of path.
it has been proven that, if every vertex in a network is of an even degree, then at least one (though possibly a lot more) circuit through that network can be found such that each edge is traversed once and once only, arriving back at the starting vertex once all other edges have been included.
A connected graph does not have an Euler circuit or a semi-Euler circuit if and only if it has more than two odd vertices. This is because any path constructed, even if the initial vertex is an odd one, will necessarily reach an odd vertex that it is not able to leave again without repeating the same edge twice (which is not allowed as we are aiming to achieve an Eulerian or semi-Eulerian circuit).
Obviously, it would be possible to start at any vertex on the graph, as they are all identical in that their degrees are all even.

Now, this will only be the case if there are no odd vertices in the network. This is because, if there is an odd degree vertex in the network, although a path may have a route into the vertex, it may not necessarily be able to leave again. There will be one occasion a path is not able to leave an odd vertex if a graph contains one or more of these, and so the cycle will break down.

3Expand

THE CHINESE POSTMAN PROBLEM - HISTORY OF PROBLEM

Tags: chinese, exam, maths, postman on 2007-12-16 -All Annotations (0) -About

in list: Mathsmodels

more frompeople.bath.ac.uk

1 - 4 of 4

List 20 50 100

Notation: * = Private bookmark and comment|… = Clipping [?] | … = Public highlight [?]

mikeem em's Related Tags

Selected tags

chinese

Related tags

See More Top Contributors

pandarra Cherice Montgomery tanady ming qing Wind Cold Isabelle Jones

Related Groups on Diigo

Private group

Members (4)

bookmarks (123)
Resources for Languages

Members (133)

bookmarks (1367)
China and Chinese

Members (11)

bookmarks (105)

Related Lists on Diigo

China unit of work

A set of bookmarks for some...

Items: 36 | Visits: 240

Created by: Rob McTaggart
民運人士 People

Items: 4 | Visits: 41

Created by: hk alliance
Learn Chinese

Items: 10 | Visits: 35

Created by: Michele Aiello

mikeem em's Bookmarks tagged chinese → View Popular

YouTube - Russell Peters: Chinese Languages

iComment: Be Heard

THE CHINESE POSTMAN PROBLEM - HOW CAN WE TELL WHETHER THERE WILL BE A SOLUTION

THE CHINESE POSTMAN PROBLEM - HISTORY OF PROBLEM

mikeem em's Related Tags

See More Top Contributors

Related Groups on Diigo

China unit of work

民運人士 People

Learn Chinese

Diigo - Highlight and Share the Web!