Plasma parameters - Revision history

12.216.194.200: /* Fundamental plasma parameters */ Put mathematical definitions in math mode. Omited extraneous definition of adiabatic index (it is included lower in the section).

2014-08-26T15:12:40Z

Fundamental plasma parameters: Put mathematical definitions in math mode. Omited extraneous definition of adiabatic index (it is included lower in the section).

← Older revision		Revision as of 17:12, 26 August 2014
Line 1:		Line 1:
	~~The author~~ is ~~recognized by~~ the title ~~of Numbers Lint~~. ~~Body building~~ is ~~one of the issues~~ I ~~love most~~. I ~~am a meter reader but~~ I ~~plan on altering it. Years in the past we moved to Puerto Rico and my family enjoys it~~.<br><br>my ~~web blog; over the counter std test -~~ [http://~~phpfoxdev~~.~~azurewebsites~~.~~net~~/index.php?do=/profile-~~44231~~/info/ ~~similar web-site~~],		Myrtle Benny is how I'm known as and I feel comfortable when people use the full title. Hiring is my occupation. Doing ceramics is what my family and I enjoy. California is exactly where I've usually been living and I adore each working day residing here.<br><br>Also visit my homepage: [http://richlinked.com/index.php?do=/profile-32092/info/ http://richlinked.com/index.php?do=/profile-32092/info/]

132.177.248.234: Undid revision 598158132 by 132.177.248.234 (talk)

2014-03-04T20:56:52Z

Undid revision 598158132 by 132.177.248.234 (talk)

← Older revision		Revision as of 22:56, 4 March 2014
Line 1:		Line 1:
	~~{{infobox graph~~		The author is recognized by the title of Numbers Lint. Body building is one of the issues I love most. I am a meter reader but I plan on altering it. Years in the past we moved to Puerto Rico and my family enjoys it.<br><br>my web blog; over the counter std test - [http://phpfoxdev.azurewebsites.net/index.php?do=/profile-44231/info/ similar web-site],
	~~\| name = King's graph~~
	~~\| image = [[Image:King's graph~~.~~svg\|180px]]~~
	~~\| image_caption = 8x8 King's graph~~
	~~\| vertices = ''nm''~~
	~~\| edges = 4''nm''-3(''n''+''m'')+2~~
	~~\| chromatic_number =~~
	~~\| chromatic_index =~~
	~~\| girth =~~
	~~\| properties =~~
	}}
	~~In [[graph theory]], a '''king's graph'''~~ is ~~a [[Graph (mathematics)\|graph]] that represents all legal moves~~ of the ~~[[king (chess)\|king]] [[chess]] [[chess piece\|piece]] on a [[chessboard]] where each vertex represents~~ a ~~square~~ on ~~a chessboard~~ and ~~each edge is a legal move~~. ~~More specifically, an~~ <~~math~~>~~n \times m~~<~~/math~~> ~~king's graph is a king's graph of an <math>n \times m</math> chessboard.<ref>{{citation~~
	~~\| last = Chang \| first = Gerard J.~~
	~~\| editor1~~-~~last = Du \| editor1-first = Ding-Zhu~~
	~~\| editor2-last = Pardalos \| editor2-first = Panos M.~~
	~~\| contribution = Algorithmic aspects of domination in graphs~~
	~~\| location = Boston, MA~~
	~~\| mr = 1665419~~
	~~\| pages = 339–405~~
	~~\| publisher = Kluwer Acad. Publ.~~
	~~\| title = Handbook of combinatorial optimization, Vol. 3~~
	~~\| year = 1998}}. Chang defines the king's graph on~~ [http://~~books~~.~~google~~.~~com~~/~~books~~?id=~~w0rmms0_hMMC&pg=PA341 p. 341].<~~/~~ref>~~

	~~For a <math>n \times m</math> king's graph the total number of vertices is simply <math>n m<~~/~~math>. For a <math>n \times n<~~/~~math> king's graph the total number of vertices is simply <math>n^2</math> and the total number of edges is <math>(2n-2)(2n~~-~~1)</math>.<ref>{{SloanesRef\|A002943}}</ref>~~

	~~The [[Neighbourhood (graph theory)\|neighbourhood of a vertex]] in the king's graph corresponds to the [[Moore neighborhood]~~] ~~for cellular automata.<ref>{{citation~~
	~~\| last = Smith \| first = Alvy Ray \| authorlink = Alvy Ray Smith~~
	~~\| contribution = Two-dimensional formal languages and pattern recognition by cellular automata~~
	~~\| doi = 10.1109/SWAT.1971.29~~
	~~\| pages = 144–152~~
	~~\| title = 12th Annual Symposium on Switching and Automata Theory~~
	~~\| year = 1971}}.</ref>~~
	~~A generalization of the king's graph, called a '''kinggraph'''~~, is formed from a [[squaregraph]] (a planar graph in which each bounded face is a quadrilateral and each interior vertex has at least four neighbors) by adding the two diagonals of every quadrilateral face of the squaregraph.<ref>{{citation
	~~\| last1 = Chepoi \| first1 = Victor~~
	~~\| last2 = Dragan \| first2 = Feodor~~
	~~\| last3 = Vaxès \| first3 = Yann~~
	~~\| contribution = Center and diameter problems in plane triangulations and quadrangulations~~
	~~\| pages = 346–355~~
	~~\| title = Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '02)~~
	~~\| year = 2002}}.</ref>~~

	~~==References==~~
	~~{{reflist}}~~

	~~==See also==~~
	* [[Knight's graph]]
	* [[Rook's graph]]
	* [[Lattice graph]]

	~~[[Category:Mathematical chess problems]]~~
	~~[[Category:Parametric families of graphs]]~~

en>Art Carlson: Undid revision 557276492 by 71.125.33.95 (talk) Gaussian units (see NRL Formulary)

2013-05-30T09:40:47Z

Undid revision 557276492 by 71.125.33.95 (talk) *Gaussian* units (see NRL Formulary)

← Older revision		Revision as of 11:40, 30 May 2013
Line 1:		Line 1:
	~~Nice to satisfy you~~, ~~my name~~ is ~~Refugia~~. ~~My working day occupation~~ is a ~~librarian~~. ~~What I adore performing is to collect badges but I~~'~~ve been using~~ on ~~new issues lately~~. ~~Puerto Rico~~ is ~~where he~~'s ~~usually been residing but she needs to move~~ simply ~~because~~ of ~~her family~~.<br><br>~~Also visit my website:~~ [~~http:~~/~~/www~~.~~escuelavirtual~~.~~registraduria~~.~~gov~~.co/~~user/view.php?id~~=~~140944&course~~=~~1 std home test~~]		{{infobox graph
			\| name = King's graph
			\| image = [[Image:King's graph.svg\|180px]]
			\| image_caption = 8x8 King's graph
			\| vertices = ''nm''
			\| edges = 4''nm''-3(''n''+''m'')+2
			\| chromatic_number =
			\| chromatic_index =
			\| girth =
			\| properties =
			}}
			In [[graph theory]], a '''king's graph''' is a [[Graph (mathematics)\|graph]] that represents all legal moves of the [[king (chess)\|king]] [[chess]] [[chess piece\|piece]] on a [[chessboard]] where each vertex represents a square on a chessboard and each edge is a legal move. More specifically, an <math>n \times m</math> king's graph is a king's graph of an <math>n \times m</math> chessboard.<ref>{{citation
			\| last = Chang \| first = Gerard J.
			\| editor1-last = Du \| editor1-first = Ding-Zhu
			\| editor2-last = Pardalos \| editor2-first = Panos M.
			\| contribution = Algorithmic aspects of domination in graphs
			\| location = Boston, MA
			\| mr = 1665419
			\| pages = 339–405
			\| publisher = Kluwer Acad. Publ.
			\| title = Handbook of combinatorial optimization, Vol. 3
			\| year = 1998}}. Chang defines the king's graph on [http://books.google.com/books?id=w0rmms0_hMMC&pg=PA341 p. 341].</ref>

			For a <math>n \times m</math> king's graph the total number of vertices is simply <math>n m</math>. For a <math>n \times n</math> king's graph the total number of vertices is simply <math>n^2</math> and the total number of edges is <math>(2n-2)(2n-1)</math>.<ref>{{SloanesRef\|A002943}}</ref>

			The [[Neighbourhood (graph theory)\|neighbourhood of a vertex]] in the king's graph corresponds to the [[Moore neighborhood]] for cellular automata.<ref>{{citation
			\| last = Smith \| first = Alvy Ray \| authorlink = Alvy Ray Smith
			\| contribution = Two-dimensional formal languages and pattern recognition by cellular automata
			\| doi = 10.1109/SWAT.1971.29
			\| pages = 144–152
			\| title = 12th Annual Symposium on Switching and Automata Theory
			\| year = 1971}}.</ref>
			A generalization of the king's graph, called a '''kinggraph''', is formed from a [[squaregraph]] (a planar graph in which each bounded face is a quadrilateral and each interior vertex has at least four neighbors) by adding the two diagonals of every quadrilateral face of the squaregraph.<ref>{{citation
			\| last1 = Chepoi \| first1 = Victor
			\| last2 = Dragan \| first2 = Feodor
			\| last3 = Vaxès \| first3 = Yann
			\| contribution = Center and diameter problems in plane triangulations and quadrangulations
			\| pages = 346–355
			\| title = Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '02)
			\| year = 2002}}.</ref>

			==References==
			{{reflist}}

			==See also==
			* [[Knight's graph]]
			* [[Rook's graph]]
			* [[Lattice graph]]

			[[Category:Mathematical chess problems]]
			[[Category:Parametric families of graphs]]

202.131.103.194: /* Fundamental plasma parameters */

2012-05-11T07:37:59Z

Fundamental plasma parameters

New page

Nice to satisfy you, my name is Refugia. My working day occupation is a librarian. What I adore performing is to collect badges but I've been using on new issues lately. Puerto Rico is where he's usually been residing but she needs to move simply because of her family.<br><br>Also visit my website: [http://www.escuelavirtual.registraduria.gov.co/user/view.php?id=140944&course=1 std home test]

← Older revision		Revision as of 22:56, 4 March 2014
Line 1:		Line 1:
	~~{{infobox graph~~		The author is recognized by the title of Numbers Lint. Body building is one of the issues I love most. I am a meter reader but I plan on altering it. Years in the past we moved to Puerto Rico and my family enjoys it.<br><br>my web blog; over the counter std test - [http://phpfoxdev.azurewebsites.net/index.php?do=/profile-44231/info/ similar web-site],
	~~\| name = King's graph~~
	~~\| image = [[Image:King's graph~~.~~svg\|180px]]~~
	~~\| image_caption = 8x8 King's graph~~
	~~\| vertices = ''nm''~~
	~~\| edges = 4''nm''-3(''n''+''m'')+2~~
	~~\| chromatic_number =~~
	~~\| chromatic_index =~~
	~~\| girth =~~
	~~\| properties =~~
	}}
	~~In [[graph theory]], a '''king's graph'''~~ is ~~a [[Graph (mathematics)\|graph]] that represents all legal moves~~ of the ~~[[king (chess)\|king]] [[chess]] [[chess piece\|piece]] on a [[chessboard]] where each vertex represents~~ a ~~square~~ on ~~a chessboard~~ and ~~each edge is a legal move~~. ~~More specifically, an~~ <~~math~~>~~n \times m~~<~~/math~~> ~~king's graph is a king's graph of an <math>n \times m</math> chessboard.<ref>{{citation~~
	~~\| last = Chang \| first = Gerard J.~~
	~~\| editor1~~-~~last = Du \| editor1-first = Ding-Zhu~~
	~~\| editor2-last = Pardalos \| editor2-first = Panos M.~~
	~~\| contribution = Algorithmic aspects of domination in graphs~~
	~~\| location = Boston, MA~~
	~~\| mr = 1665419~~
	~~\| pages = 339–405~~
	~~\| publisher = Kluwer Acad. Publ.~~
	~~\| title = Handbook of combinatorial optimization, Vol. 3~~
	~~\| year = 1998}}. Chang defines the king's graph on~~ [http://~~books~~.~~google~~.~~com~~/~~books~~?id=~~w0rmms0_hMMC&pg=PA341 p. 341].<~~/~~ref>~~

	~~For a <math>n \times m</math> king's graph the total number of vertices is simply <math>n m<~~/~~math>. For a <math>n \times n<~~/~~math> king's graph the total number of vertices is simply <math>n^2</math> and the total number of edges is <math>(2n-2)(2n~~-~~1)</math>.<ref>{{SloanesRef\|A002943}}</ref>~~

	~~The [[Neighbourhood (graph theory)\|neighbourhood of a vertex]] in the king's graph corresponds to the [[Moore neighborhood]~~] ~~for cellular automata.<ref>{{citation~~
	~~\| last = Smith \| first = Alvy Ray \| authorlink = Alvy Ray Smith~~
	~~\| contribution = Two-dimensional formal languages and pattern recognition by cellular automata~~
	~~\| doi = 10.1109/SWAT.1971.29~~
	~~\| pages = 144–152~~
	~~\| title = 12th Annual Symposium on Switching and Automata Theory~~
	~~\| year = 1971}}.</ref>~~
	~~A generalization of the king's graph, called a '''kinggraph'''~~, is formed from a [[squaregraph]] (a planar graph in which each bounded face is a quadrilateral and each interior vertex has at least four neighbors) by adding the two diagonals of every quadrilateral face of the squaregraph.<ref>{{citation
	~~\| last1 = Chepoi \| first1 = Victor~~
	~~\| last2 = Dragan \| first2 = Feodor~~
	~~\| last3 = Vaxès \| first3 = Yann~~
	~~\| contribution = Center and diameter problems in plane triangulations and quadrangulations~~
	~~\| pages = 346–355~~
	~~\| title = Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '02)~~
	~~\| year = 2002}}.</ref>~~

	~~==References==~~
	~~{{reflist}}~~

	~~==See also==~~
	* [[Knight's graph]]
	* [[Rook's graph]]
	* [[Lattice graph]]

	~~[[Category:Mathematical chess problems]]~~
	~~[[Category:Parametric families of graphs]]~~

Plasma parameters - Revision history

12.216.194.200: /* Fundamental plasma parameters */ Put mathematical definitions in math mode. Omited extraneous definition of adiabatic index (it is included lower in the section).

132.177.248.234: Undid revision 598158132 by 132.177.248.234 (talk)

en>Art Carlson: Undid revision 557276492 by 71.125.33.95 (talk) *Gaussian* units (see NRL Formulary)

202.131.103.194: /* Fundamental plasma parameters */

en>Art Carlson: Undid revision 557276492 by 71.125.33.95 (talk) Gaussian units (see NRL Formulary)