digplanet beta 1: Athena
Share digplanet:

Agriculture

Applied sciences

Arts

Belief

Business

Chronology

Culture

Education

Environment

Geography

Health

History

Humanities

Language

Law

Life

Mathematics

Nature

People

Politics

Science

Society

Technology

Star
Star network 7.svg
The star S7. (Some authors index this as S8.)
Vertices k+1
Edges k
Diameter minimum of (2, k)
Girth
Chromatic number minimum of (2, k + 1)
Chromatic index k
Properties Edge-transitive
Tree
Unit distance
Bipartite
Notation Sk

In graph theory, a star Sk is the complete bipartite graph K1,k: a tree with one internal node and k leaves (but, no internal nodes and k + 1 leaves when k ≤ 1). Alternatively, some authors define Sk to be the tree of order k with maximum diameter 2; in which case a star of k > 2 has k − 1 leaves.

A star with 3 edges is called a claw.

The star Sk is edge-graceful when k is even and not when k is odd. It is an edge-transitive matchstick graph, and has diameter 2 (when k > 1), girth ∞ (it has no cycles), chromatic index k, and chromatic number 2 (when k > 0). Additionally, the star has large automorphism group, namely, the symmetric group on k letters.

Stars may also be described as the only connected graphs in which at most one vertex has degree greater than one.

Relation to other graph families[edit]

Claws are notable in the definition of claw-free graphs, graphs that do not have any claw as an induced subgraph.[1][2] They are also one of the exceptional cases of the Whitney graph isomorphism theorem: in general, graphs with isomorphic line graphs are themselves isomorphic, with the exception of the claw and the triangle K3.[3]

A star is a special kind of tree. As with any tree, stars may be encoded by a Prüfer sequence; the Prüfer sequence for a star K1,k consists of k − 1 copies of the center vertex.[4]

Several graph invariants are defined in terms of stars. Star arboricity is the minimum number of forests that a graph can be partitioned into such that each tree in each forest is a star,[5] and the star chromatic number of a graph is the minimum number of colors needed to color its vertices in such a way that every two color classes together form a subgraph in which all connected components are stars.[6] The graphs of branchwidth 1 are exactly the graphs in which each connected component is a star.[7]

The star graphs S3, S4, S5 and S6.

Other applications[edit]

The set of distances between the vertices of a claw provides an example of a finite metric space that cannot be embedded isometrically into a Euclidean space of any dimension.[8]

The star network, a computer network modeled after the star graph, is important in distributed computing.

A geometric realization of the star graph, formed by identifying the edges with intervals of some fixed length, is used as a local model of curves in tropical geometry. A tropical curve is defined to be a metric space that is locally isomorphic to a star shaped metric graph.

References[edit]

  1. ^ Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221 .
  2. ^ Chudnovsky, Maria; Seymour, Paul (2005), "The structure of claw-free graphs", Surveys in combinatorics 2005, London Math. Soc. Lecture Note Ser. 327, Cambridge: Cambridge Univ. Press, pp. 153–171, MR 2187738 .
  3. ^ Whitney, Hassler (January 1932), "Congruent Graphs and the Connectivity of Graphs", American Journal of Mathematics 54 (1): 150–168, JSTOR 2371086 .
  4. ^ Gottlieb, J.; Julstrom, B. A.; Rothlauf, F.; Raidl, G. R. (2001), "Prüfer numbers: A poor representation of spanning trees for evolutionary search", Proc. Genetic and Evolutionary Computation Conference, Morgan Kaufmann, pp. 343–350 .
  5. ^ Hakimi, S. L.; Mitchem, J.; Schmeichel, E. E. (1996), "Star arboricity of graphs", Discrete Math. 149: 93–98, doi:10.1016/0012-365X(94)00313-8 
  6. ^ Fertin, Guillaume; Raspaud, André; Reed, Bruce (2004), "Star coloring of graphs", Journal of Graph Theory 47 (3): 163–182, doi:10.1002/jgt.20029 .
  7. ^ Robertson, Neil; Seymour, Paul D. (1991), "Graph minors. X. Obstructions to tree-decomposition", Journal of Combinatorial Theory 52 (2): 153–190, doi:10.1016/0095-8956(91)90061-N .
  8. ^ Linial, Nathan (2002), "Finite metric spaces–combinatorics, geometry and algorithms", Proc. International Congress of Mathematicians, Beijing 3, pp. 573–586, arXiv:math/0304466 

Original courtesy of Wikipedia: http://en.wikipedia.org/wiki/Star_(graph_theory) — Please support Wikipedia.
A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia.
3060 videos foundNext > 

Pantazis' Golden Star (based on Petersen's Graph)

http://www.24cell.net This is a relatively easy puzzle based on the Petersen Graph. The goal is to interchange the outer pentagon with the inner star (from s...

Line 22 7b284 Bipartite Graph Isomorphic Bijection Wormhole Structure Symmetry WOW SETI

http://alienspacesciencenews.wordpress.com/ 7b97z 284 of 100 videos there are more videos after this one #170 wont upload., #206 wont upload i'll post all th...

Knowledge Scroller

Faraday rotator, Quantum cohomology, Cup product, Piecewise linear function, Radon transform, Contour map, Lebesgue integration, Plane wave, Riemann integral...

Cutting the Star Math Puzzle solution

Here's one way to do this: http://www.youtube.com/watch?v=LJFUMHs-gdY As you can see, you even get a second star in the drawing. I hope you enjoyed this one....

Ramsey theory on QI (Higher Quality)

A question to do with Ramsey theory, an area of Graph Theory, appears on QI. This is from episode 6 of series 'G' ('Genius'), broadcast 1st Jan 2010.

Ear Decomposition of the Petersen Graph

http://demonstrations.wolfram.com/EarDecompositionOfThePetersenGraph The Wolfram Demonstrations Project contains thousands of free interactive visualizations...

Electrical #1: Star Delta Transformation Explained

In this video I'll tell you Star-Delta Transformation and vice-versa. This is my new series of videos,let me know how you like it. If I get good response,I'l...

論文報告 ― hyper Hamiltonian laceability on edge fault star graph

這是2006/12/13 書報討論課程裡面的論文報告。 dyu csie.

Wolf Prize Laureate Laszlo Lovasz on "Which Graphs Are Extremal?"

Which graphs are extremal? Extremal graph theory has matured in a sense; besides studying specific extremal problems, now we can pose and, in part, answer ge...

Roto Grip Wrecker, Critical Theory, Rising Star and Storm Lucid on 2012 Masters pattern

Same shot as last week (2012 USBC Masters), but used a ball at 500 grit to carve it up quite a bit and then followed up with my lucid. Still had multiple ang...

3060 videos foundNext > 

We're sorry, but there's no news about "Star (graph theory)" right now.

Loading

Oops, we seem to be having trouble contacting Twitter

Talk About Star (graph theory)

You can talk about Star (graph theory) with people all over the world in our discussions.

Support Wikipedia

A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia. Please add your support for Wikipedia!