|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{Graph families defined by their automorphisms}}
| | CMS provides the best platform to create websites that fulfill all the specifications of SEO. It is very easy to customize plugins according to the needs of a particular business. The Word - Press Dashboard : an administrative management tool that supports FTP content upload 2. If you are using videos on your site then this is the plugin to use. Also our developers are well convergent with the latest technologies and bitty-gritty of wordpress website design and promises to deliver you the best solution that you can ever have. <br><br> |
| In [[graph theory]], a branch of mathematics, a '''skew-symmetric graph''' is a [[directed graph]] that is [[graph isomorphism|isomorphic]] to its own [[transpose graph]], the graph formed by reversing all of its edges, under an isomorphism that is an [[involution (mathematics)|involution]] without any [[Fixed point (mathematics)|fixed points]]. Skew-symmetric graphs are identical to the [[Bipartite double cover|double covering graphs]] of [[bidirected graph]]s.
| |
|
| |
|
| Skew-symmetric graphs were first introduced under the name of ''antisymmetrical digraphs'' by {{harvtxt|Tutte|1967}}, later as the double covering graphs of polar graphs by {{harvtxt|Zelinka|1976b}}, and still later as the double covering graphs of bidirected graphs by {{harvtxt|Zaslavsky|1991}}. They arise in modeling the search for alternating paths and alternating cycles in algorithms for finding [[Matching (graph theory)|matchings]] in graphs, in testing whether a [[still life (cellular automaton)|still life]] pattern in [[Conway's Game of Life]] may be partitioned into simpler components, in [[graph drawing]], and in the [[implication graph]]s used to efficiently solve the [[2-satisfiability]] problem.
| | These folders as well as files have to copied and the saved. If you enjoyed this information and you would certainly like to get even more facts pertaining to [http://gallatincountykyclerk.com/uncategorized/hello-world/ wordpress dropbox backup] kindly go to the site. The higher your blog ranks on search engines, the more likely people will find your online marketing site. There are number of web services that offer Word press development across the world. It primarily lays emphasis on improving the search engine results of your website whenever a related query is typed in the search box. Many times the camera is following Mia, taking in her point of view in almost every frame. <br><br>It is also popular because willing surrogates,as well as egg and sperm donors,are plentiful. s cutthroat competition prevailing in the online space won. If Gandhi was empowered with a blogging system, every event in his life would have been minutely documented so that it could be recounted to the future generations. Every single Theme might be unique, providing several alternatives for webpage owners to reap the benefits of in an effort to instantaneously adjust their web page appear. " Thus working with a Word - Press powered web application, making any changes in the website design or website content is really easy and self explanatory. <br><br>Google Maps Excellent navigation feature with Google Maps and latitude, for letting people who have access to your account Latitude know exactly where you are. The SEOPressor Word - Press SEO Plugin works by analysing each page and post against your chosen keyword (or keyword phrase) and giving a score, with instructions on how to improve it. The templates are designed to be stand alone pages that have a different look and feel from the rest of your website. Can you imagine where you would be now if someone in your family bought an original painting from van Gogh during his lifetime. Digital digital cameras now function gray-scale configurations which allow expert photographers to catch images only in black and white. <br><br>Every single module contains published data and guidelines, usually a lot more than 1 video, and when pertinent, incentive links and PDF files to assist you out. Mahatma Gandhi is known as one of the most prominent personalities and symbols of peace, non-violence and freedom. It's not a secret that a lion share of activity on the internet is takes place on the Facebook. Thus, Word - Press is a good alternative if you are looking for free blogging software. Definitely when you wake up from the slumber, you can be sure that you will be lagging behind and getting on track would be a tall order. |
| | |
| ==Definition==
| |
| As defined, e.g., by {{harvtxt|Goldberg|Karzanov|1996}}, a skew-symmetric graph ''G'' is a directed graph, together with a function σ mapping vertices of ''G'' to other vertices of ''G'', satisfying the following properties:
| |
| # For every vertex ''v'', σ(''v'') ≠ ''v'',
| |
| # For every vertex ''v'', σ(σ(''v'')) = ''v'',
| |
| # For every edge (''u'',''v''), (σ(''v''),σ(''u'')) must also be an edge.
| |
| One may use the third property to extend σ to an orientation-reversing function on the edges of ''G''.
| |
| | |
| The [[transpose graph]] of ''G'' is the graph formed by reversing every edge of ''G'', and σ defines a [[graph isomorphism]] from ''G'' to its transpose. However, in a skew-symmetric graph, it is additionally required that the isomorphism pair each vertex with a different vertex, rather than allowing a vertex to be mapped to itself by the isomorphism or to group more than two vertices in a cycle of isomorphism. | |
| | |
| A path or cycle in a skew-symmetric graph is said to be ''regular'' if, for each vertex ''v'' of the path or cycle, the corresponding vertex σ(''v'') is not part of the path or cycle.
| |
| | |
| ==Examples==
| |
| Every directed [[path graph]] with an even number of vertices is skew-symmetric, via a symmetry that swaps the two ends of the path. However, path graphs with an odd number of vertices are not skew-symmetric, because the orientation-reversing symmetry of these graphs maps the center vertex of the path to itself, something that is not allowed for skew-symmetric graphs.
| |
| | |
| Similarly, a directed [[cycle graph]] is skew-symmetric if and only if it has an even number of vertices. In this case, the number of different mappings σ that realize the skew symmetry of the graph equals half the length of the cycle.
| |
| | |
| ==Polar/switch graphs, double covering graphs, and bidirected graphs==
| |
| A skew-symmetric graph may equivalently be defined as the double covering graph of a ''polar graph'' (introduced by {{harvtxt|Zelinka|1974}}, {{harvtxt|Zelinka|1976}}, called a ''switch graph'' by {{harvtxt|Cook|2003}}), which is an undirected graph in which the edges incident to each vertex are partitioned into two subsets. Each vertex of the polar graph corresponds to two vertices of the skew-symmetric graph, and each edge of the polar graph corresponds to two edges of the skew-symmetric graph. This equivalence is the one used by {{harvtxt|Goldberg|Karzanov|1996}} to model problems of matching in terms of skew-symmetric graphs; in that application, the two subsets of edges at each vertex are the unmatched edges and the matched edges. Zelinka (following F. Zitek) and Cook visualize the vertices of a polar graph as points where multiple tracks of a [[train track (mathematics)|train track]] come together: if a train enters a switch via a track that comes in from one direction, it must exit via a track in the other direction. The problem of finding non-self-intersecting smooth curves between given points in a train track comes up in testing whether certain kinds of [[graph drawing]]s are valid {{harv|Hui|Schaefer|Štefankovič|2004}} and may be modeled as the search for a regular path in a skew-symmetric graph.
| |
| | |
| A closely related concept is the [[bidirected graph]] of {{harvtxt|Edmonds|Johnson|1970}} ("polarized graph" in the terminology of {{harvtxt|Zelinka|1974}}, {{harvtxt|Zelinka|1976}}), a graph in which each of the two ends of each edge may be either a head or a tail, independently of the other end. A bidirected graph may be interpreted as a polar graph by letting the partition of edges at each vertex be determined by the partition of endpoints at that vertex into heads and tails; however, swapping the roles of heads and tails at a single vertex ("switching" the vertex, in the terminology of {{harvtxt|Zaslavsky|1991}}) produces a different bidirected graph but the same polar graph.
| |
| | |
| For the correspondence between bidirected graphs and skew-symmetric graphs (i.e., their double covering graphs) see {{harvtxt|Zaslavsky|1991}}, Section 5, or {{harvtxt|Babenko|2006}}.
| |
| | |
| To form the double covering graph (i.e., the corresponding skew-symmetric graph) from a polar graph ''G'', create for each vertex ''v'' of ''G'' two vertices ''v''<sub>0</sub> and ''v''<sub>1</sub>, and let σ(''v''<sub>''i''</sub>) = ''v''<sub>1 − ''i''</sub>. For each edge ''e'' = (''u'',''v'') of ''G'', create two directed edges in the covering graph, one oriented from ''u'' to ''v'' and one oriented from ''v'' to ''u''. If ''e'' is in the first subset of edges at ''v'', these two edges are from ''u''<sub>0</sub> into ''v''<sub>0</sub> and from ''v''<sub>1</sub> into ''u''<sub>1</sub>, while if ''e'' is in the second subset, the edges are from ''u''<sub>0</sub> into ''v''<sub>1</sub> and from ''v''<sub>0</sub> into ''u''<sub>1</sub>.
| |
| In the other direction, given a skew-symmetric graph ''G'', one may form a polar graph that has one vertex for every corresponding pair of vertices in ''G'' and one undirected edge for every corresponding pair of edges in ''G''. The undirected edges at each vertex of the polar graph may be partitioned into two subsets according to which vertex of the polar graph they go out of and come in to.
| |
| | |
| A regular path or cycle of a skew-symmetric graph corresponds to a path or cycle in the polar graph that uses at most one edge from each subset of edges at each of its vertices.
| |
| | |
| ==Matching==
| |
| In constructing [[Matching (graph theory)|matchings]] in undirected graphs, it is important to find ''alternating paths'', paths of vertices that start and end at unmatched vertices, in which the edges at odd positions in the path are not part of a given partial matching and in which the edges at even positions in the path are part of the matching. By removing the matched edges of such a path from a matching, and adding the unmatched edges, one can increase the size of the matching. Similarly, cycles that alternate between matched and unmatched edges are of importance in weighted matching problems.
| |
| As {{harvtxt|Goldberg|Karzanov|1996}} showed, an alternating path or cycle in an undirected graph may be modeled as a regular path or cycle in a skew-symmetric directed graph. To create a skew-symmetric graph from an undirected graph ''G'' with a specified matching ''M'', view ''G'' as a switch graph in which the edges at each vertex are partitioned into matched and unmatched edges; an alternating path in ''G'' is then a regular path in this switch graph and an alternating cycle in ''G'' is a regular cycle in the switch graph.
| |
| | |
| {{harvtxt|Goldberg|Karzanov|1996}} generalized alternating path algorithms to show that the existence of a regular path between any two vertices of a skew-symmetric graph may be tested in linear time. Given additionally a non-negative length function on the edges of the graph that assigns the same length to any edge ''e'' and to σ(''e''), the shortest regular path connecting a given pair of nodes in a skew-symmetric graph with ''m'' edges and ''n'' vertices may be tested in time O(''m'' log ''n''). If the length function is allowed to have negative lengths, the existence of a negative regular cycle may be tested in polynomial time.
| |
| | |
| Along with the path problems arising in matchings, skew-symmetric generalizations of the [[max-flow min-cut theorem]] have also been studied ({{harvnb|Goldberg|Karzanov|2004}}; {{harvnb|Tutte|1967}}).
| |
| | |
| ==Still life theory==
| |
| {{harvtxt|Cook|2003}} shows that a [[still life (cellular automaton)|still life pattern]] in [[Conway's Game of Life]] may be partitioned into two smaller still lifes if and only if an associated switch graph contains a regular cycle. As he shows, for switch graphs with at most three edges per vertex, this may be tested in polynomial time by repeatedly removing [[Bridge (graph theory)|bridges]] (edges the removal of which disconnects the graph) and vertices at which all edges belong to a single partition until no more such simplifications may be performed. If the result is an [[empty graph]], there is no regular cycle; otherwise, a regular cycle may be found in any remaining bridgeless component. The repeated search for bridges in this algorithm may be performed efficiently using a dynamic graph algorithm of {{harvtxt|Thorup|2000}}.
| |
| | |
| Similar bridge-removal techniques in the context of matching were previously considered by {{harvtxt|Gabow|Kaplan|Tarjan|1999}}.
| |
| | |
| ==Satisfiability==
| |
| [[File:Implication graph.svg|thumb|240px|An [[implication graph]]. Its skew symmetry can be realized by rotating the graph through a 180 degree angle and reversing all edges.]]
| |
| An instance of the [[2-satisfiability]] problem, that is, a Boolean expression in [[conjunctive normal form]] with two variables or negations of variables per clause, may be transformed into an [[implication graph]] by replacing each clause <math>\scriptstyle u\lor v</math> by the two implications
| |
| <math>\scriptstyle(\lnot u)\Rightarrow v</math> and <math>\scriptstyle(\lnot v)\Rightarrow u</math>. This graph has a vertex for each variable or negated variable, and a directed edge for each implication; it is, by construction, skew-symmetric, with a correspondence σ that maps each variable to its negation. | |
| As {{harvtxt|Aspvall|Plass|Tarjan|1979}} showed, a satisfying assignment to the 2-satisfiability instance is equivalent to a partition of this implication graph into two subsets of vertices, ''S'' and σ(''S''), such that no edge starts in ''S'' and ends in σ(''S''). If such a partition exists, a satisfying assignment may be formed by assigning a true value to every variable in ''S'' and a false value to every variable in σ(''S''). This may be done if and only if no [[strongly connected component]] of the graph contains both some vertex ''v'' and its complementary vertex σ(''v''). If two vertices belong to the same strongly connected component, the corresponding variables or negated variables are constrained to equal each other in any satisfying assignment of the 2-satisfiability instance. The total time for testing strong connectivity and finding a partition of the implication graph is linear in the size of the given 2-CNF expression.
| |
| | |
| ==Recognition==
| |
| It is [[NP-complete]] to determine whether a given directed graph is skew-symmetric, by a result of {{harvtxt|Lalonde|1981}} that it is NP-complete to find a color-reversing involution in a [[bipartite graph]]. Such an involution exists if and only if the directed graph given by [[Orientation (graph theory)|orienting]] each edge from one color class to the other is skew-symmetric, so testing skew-symmetry of this directed graph is hard. This complexity does not affect path-finding algorithms for skew-symmetric graphs, because these algorithms assume that the skew-symmetric structure is given as part of the input to the algorithm rather than requiring it to be inferred from the graph alone.
| |
| | |
| ==References==
| |
| *{{citation
| |
| | last1 = Aspvall | first1 = Bengt
| |
| | last2 = Plass | first2 = Michael F.
| |
| | authorlink3 = Robert Tarjan | last3 = Tarjan | first3 = Robert E.
| |
| | title = A linear-time algorithm for testing the truth of certain quantified boolean formulas
| |
| | journal = Information Processing Letters
| |
| | volume = 8 | issue = 3 | pages = 121–123 | year = 1979
| |
| | doi = 10.1016/0020-0190(79)90002-4}}.
| |
| *{{citation
| |
| | last = Babenko | first = Maxim A.
| |
| | contribution = Acyclic bidirected and skew-symmetric graphs: algorithms and structure
| |
| | title = Computer Science – Theory and Applications
| |
| | publisher = Springer-Verlag | series = Lecture Notes in Computer Science | year = 2006 | volume = 3967
| |
| | pages = 23–34 | doi = 10.1007/11753728_6
| |
| | isbn = 978-3-540-34166-6}}.
| |
| *{{citation
| |
| | last = Biggs | first = Norman | authorlink = Norman L. Biggs
| |
| | title = Algebraic Graph Theory
| |
| | publisher = Cambridge University Press | place = London | year = 1974 }}.
| |
| *{{citation
| |
| | authorlink = Matthew Cook
| |
| | last = Cook | first = Matthew
| |
| | contribution = Still life theory
| |
| | year = 2003
| |
| | title = New Constructions in Cellular Automata
| |
| | publisher = Santa Fe Institute Studies in the Sciences of Complexity, Oxford University Press
| |
| | pages = 93–118}}.
| |
| *{{citation
| |
| | last1 = Edmonds | first1 = Jack | authorlink1 = Jack Edmonds
| |
| | last2 = Johnson | first2 = Ellis L.
| |
| | contribution = Matching: a well-solved class of linear programs
| |
| | title = Combinatorial Structures and their Applications: Proceedings of the Calgary Symposium, June 1969
| |
| | publisher = Gordon and Breach | location = New York | year = 1970
| |
| }}. Reprinted in ''Combinatorial Optimization — Eureka, You Shrink!'', Springer-Verlag, Lecture Notes in Computer Science 2570, 2003, pp. 27–30, {{doi|10.1007/3-540-36478-1_3}}.
| |
| *{{citation
| |
| | last1 = Gabow | first1 = Harold N.
| |
| | last2 = Kaplan | first2 = Haim
| |
| | last3 = Tarjan | first3 = Robert E. | authorlink3 = Robert Tarjan
| |
| | contribution = Unique maximum matching algorithms
| |
| | title = Proc. 31st ACM Symp. Theory of Computing (STOC)
| |
| | year = 1999 | pages = 70–78
| |
| | doi = 10.1145/301250.301273
| |
| | isbn = 1-58113-067-8}}.
| |
| *{{citation
| |
| | last1 = Goldberg | first1 = Andrew V. | author1-link = Andrew V. Goldberg
| |
| | last2 = Karzanov | first2 = Alexander V.
| |
| | title = Path problems in skew-symmetric graphs
| |
| | journal = Combinatorica
| |
| | volume = 16 | issue = 3 | year = 1996 | pages = 353–382
| |
| | doi = 10.1007/BF01261321}}.
| |
| *{{citation
| |
| | last1 = Goldberg | first1 = Andrew V. | author1-link = Andrew V. Goldberg
| |
| | last2 = Karzanov | first2 = Alexander V.
| |
| | title = Maximum skew-symmetric flows and matchings
| |
| | journal = Mathematical programming
| |
| | volume = 100 | issue = 3 | year = 2004 | pages = 537–568
| |
| | doi = 10.1007/s10107-004-0505-z}}.
| |
| *{{citation
| |
| | last1 = Hui | first1 = Peter
| |
| | last2 = Schaefer | first2 = Marcus
| |
| | last3 = Štefankovič | first3 = Daniel
| |
| | contribution = Train tracks and confluent drawings
| |
| | title = [[International Symposium on Graph Drawing|Proc. 12th Int. Symp. Graph Drawing]]
| |
| | publisher = Springer-Verlag
| |
| | series = Lecture Notes in Computer Science
| |
| | volume = 3383 | year = 2004 | pages = 318–328}}.
| |
| *{{citation
| |
| | last = Lalonde | first = François
| |
| | doi = 10.1016/0012-365X(81)90271-5
| |
| | issue = 3
| |
| | journal = Discrete Mathematics
| |
| | mr = 602044
| |
| | pages = 271–280
| |
| | title = Le problème d'étoiles pour graphes est NP-complet
| |
| | volume = 33
| |
| | year = 1981}}.
| |
| *{{citation|first=Mikkel|last=Thorup|authorlink=Mikkel Thorup|year=2000|pages=343–350|doi=10.1145/335305.335345|contribution=Near-optimal {{Sic|hide=y|fully|-}}dynamic graph connectivity|title=[[Symposium on Theory of Computing|Proc. 32nd ACM Symposium on Theory of Computing]]|isbn=1-58113-184-4}}.
| |
| *{{citation
| |
| | last = Tutte | first = W. T. | authorlink = W. T. Tutte
| |
| | title = Antisymmetrical digraphs
| |
| | journal = Canadian Journal of Mathematics
| |
| | volume = 19 | pages = 1101–1117 | year = 1967
| |
| | doi = 10.4153/CJM-1967-101-8}}.
| |
| *{{citation
| |
| | last = Zaslavsky | first = Thomas | authorlink = Thomas Zaslavsky
| |
| | title = Signed graphs
| |
| | journal = Discrete Applied Mathematics
| |
| | volume = 4 | pages = 47–74 | year = 1982 | doi=10.1016/0166-218X(82)90033-6}}.
| |
| *{{citation
| |
| | last = Zaslavsky | first = Thomas | authorlink = Thomas Zaslavsky
| |
| | title = Orientation of signed graphs
| |
| | journal = European Journal of Combinatorics
| |
| | volume = 12 | pages = 361–375 | year = 1991 }}.
| |
| *{{citation
| |
| | last = Zelinka | first = Bohdan
| |
| | title = Polar graphs and railway traffic
| |
| | journal = Aplikace Matematiky
| |
| | volume = 19 | pages = 169–176 | year = 1974 }}.
| |
| *{{citation
| |
| | last = Zelinka | first = Bohdan
| |
| | title = Isomorphisms of polar and polarized graphs
| |
| | journal = Czechoslovak Mathematical Journal
| |
| | volume = 26 | pages = 339–351 | year = 1976a }}.
| |
| *{{citation
| |
| | last = Zelinka | first = Bohdan
| |
| | title = Analoga of Menger's theorem for polar and polarized graphs
| |
| | journal = Czechoslovak Mathematical Journal
| |
| | volume = 26 | pages = 352–360 | year = 1976b }}.
| |
| | |
| [[Category:Graph families]]
| |
| [[Category:Directed graphs]]
| |
| [[Category:Matching]]
| |
CMS provides the best platform to create websites that fulfill all the specifications of SEO. It is very easy to customize plugins according to the needs of a particular business. The Word - Press Dashboard : an administrative management tool that supports FTP content upload 2. If you are using videos on your site then this is the plugin to use. Also our developers are well convergent with the latest technologies and bitty-gritty of wordpress website design and promises to deliver you the best solution that you can ever have.
These folders as well as files have to copied and the saved. If you enjoyed this information and you would certainly like to get even more facts pertaining to wordpress dropbox backup kindly go to the site. The higher your blog ranks on search engines, the more likely people will find your online marketing site. There are number of web services that offer Word press development across the world. It primarily lays emphasis on improving the search engine results of your website whenever a related query is typed in the search box. Many times the camera is following Mia, taking in her point of view in almost every frame.
It is also popular because willing surrogates,as well as egg and sperm donors,are plentiful. s cutthroat competition prevailing in the online space won. If Gandhi was empowered with a blogging system, every event in his life would have been minutely documented so that it could be recounted to the future generations. Every single Theme might be unique, providing several alternatives for webpage owners to reap the benefits of in an effort to instantaneously adjust their web page appear. " Thus working with a Word - Press powered web application, making any changes in the website design or website content is really easy and self explanatory.
Google Maps Excellent navigation feature with Google Maps and latitude, for letting people who have access to your account Latitude know exactly where you are. The SEOPressor Word - Press SEO Plugin works by analysing each page and post against your chosen keyword (or keyword phrase) and giving a score, with instructions on how to improve it. The templates are designed to be stand alone pages that have a different look and feel from the rest of your website. Can you imagine where you would be now if someone in your family bought an original painting from van Gogh during his lifetime. Digital digital cameras now function gray-scale configurations which allow expert photographers to catch images only in black and white.
Every single module contains published data and guidelines, usually a lot more than 1 video, and when pertinent, incentive links and PDF files to assist you out. Mahatma Gandhi is known as one of the most prominent personalities and symbols of peace, non-violence and freedom. It's not a secret that a lion share of activity on the internet is takes place on the Facebook. Thus, Word - Press is a good alternative if you are looking for free blogging software. Definitely when you wake up from the slumber, you can be sure that you will be lagging behind and getting on track would be a tall order.