نتایج جستجو برای: eulerian graph

تعداد نتایج: 202900  

Journal: :journal of algebra and related topics 2015
a. sharma a. gaur

let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...

Journal: :caspian journal of mathematical sciences 2012
a.b. attar

in this paper we define the removable cycle that, if $im$ is a class of graphs, $gin im$, the cycle $c$ in $g$ is called removable if $g-e(c)in im$. the removable cycles in eulerian graphs have been studied. we characterize eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for eulerian graph to have removable cycles h...

Journal: :transactions on combinatorics 2012
p. balakrishnan r. kala

‎in this paper we introduce the concept of order difference interval graph $gamma_{odi}(g)$ of a group $g$‎. ‎it is a graph $gamma_{odi}(g)$ with $v(gamma_{odi}(g)) = g$ and two vertices $a$ and $b$ are adjacent in $gamma_{odi}(g)$ if and only if $o(b)-o(a) in [o(a)‎, ‎o(b)]$‎. ‎without loss of generality‎, ‎we assume that $o(a) leq o(b)$‎. ‎in this paper we obtain several properties of $gamma_...

In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...

Journal: :caspian journal of mathematical sciences 2014
a. b‎. ‎ attar a. a‎. ‎ sangoor

‎in this paper we defined the vertex removable cycle in respect of the following‎, ‎if $f$ is a class of graphs(digraphs)‎ ‎satisfying certain property‎, ‎$g in f $‎, ‎the cycle $c$ in $g$ is called vertex removable if $g-v(c)in in f $.‎ ‎the vertex removable cycles of eulerian graphs are studied‎. ‎we also characterize the edge removable cycles of regular‎ ‎graphs(digraphs).‎

Journal: :transactions on combinatorics 0
narges ghareghani university of tehran

recently, e. m'{a}v{c}ajov'{a} and m. v{s}koviera proved that every bidirected eulerian graph which admits a nowhere zero flow, admits a nowhere zero $4$-flow. this result shows the validity of bouchet's nowhere zero conjecture for eulerian bidirected graphs. in this paper we prove the same theorem in a different terminology and with a short and simple proof. more precisely, we p...

Journal: :Discussiones Mathematicae Graph Theory 2014
Eric Andrews Chira Lumduanhom Ping Zhang

A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circuit. A graph is Eulerian if it contains an Eulerian circuit. It is well known that a connected graph G is Eulerian if and only if every vertex of G is even. An Eulerian walk in a connected graph G is a closed walk that contains every edge of G at least once, while an irregular Eulerian walk in G i...

1996
David Eppstein

Any bipartite Eulerian graph, any Eulerian graph with evenly many vertices, and any bipartite graph with evenly many vertices and edges, has an even number of spanning trees. More generally, a graph has evenly many spanning trees if and only if it has an Eulerian edge cut. ∗Work supported in part by NSF grant CCR-9258355 and by matching funds from Xerox Corp.

Journal: :Discrete Mathematics 2004
Tomaz Pisanski Thomas W. Tucker Arjana Zitnik

A straight ahead walk in an embedded Eulerian graph G always passes from an edge to the opposite edge in the rotation at the same vertex A straight ahead walk is called Eulerian if all the edges of the embedded graph G are traversed in this way starting from an arbitrary edge An embedding that contains an Eulerian straight ahead walk is called an Eulerian embedding In this article we characteri...

2011
Zhenghui Wang

Consider an undirected Eulerian graph, a graph in which each vertex has even degree. An Eulerian orientation of the graph is an orientation of its edges such that for each vertex v, the number of incoming edges of v equals to outgoing edges of v, i.e. din(v) = dout(v). Let P0 denote the set of all Eulerian orientations of graph G. In this paper, we are concerned with the questions of sampling u...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید