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

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

Journal: :journal of algorithms and computation 0
kristiana wijaya combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia lyra yulianti department of mathematics, faculty of mathematics and natural sciences, andalas university, kampus unand limau manis padang 25136 indonesia edy tri baskoro combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia hilda assiyatun combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia djoko suprijanto combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...

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 2013
masoud ariannejad mojgan emami

we give a new recursive method to compute the number of cliques and cycles of a graph. this method is related, respectively to the number of disjoint cliques in the complement graph and to the sum of permanent function over all principal minors of the adjacency matrix of the graph. in particular, let $g$ be a graph and let $overline {g}$ be its complement, then given the chromatic polynomial of...

Journal: :bulletin of the iranian mathematical society 2011
e. mphako-banda

Journal: :bulletin of the iranian mathematical society 2015
m. jannesari

a set $wsubseteq v(g)$ is called a resolving set for $g$, if for each two distinct vertices $u,vin v(g)$ there exists $win w$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. the minimum cardinality of a resolving set for $g$ is called the metric dimension of $g$, and denoted by $dim(g)$. in this paper, it is proved that in a connected graph $...

Journal: :journal of algorithms and computation 0
g. marimuthu department of mathematics, the madura college, madurai -625 011, tamilnadu, india s. stalin kumar department of mathematics, the american college, madurai - 625 002, tamilnadu,india

an h-magic labeling in a h-decomposable graph g is a bijection f : v (g) ∪ e(g) → {1, 2, ..., p + q} such that for every copy h in the decomposition, σνεv(h) f(v) +  σeεe(h) f(e) is constant. f is said to be h-e-super magic if f(e(g)) = {1, 2, · · · , q}. a family of subgraphs h1,h2, · · · ,hh of g is a mixed cycle-decomposition of g if every subgraph hi is isomorphic to some cycle ck, for k ≥ ...

Journal: :journal of algorithms and computation 0
d. jelodar university of tehran, department of algorithms and computation d. moazzami university of tehran, college of engineering, department of engineering science p. nasehpour university of tehran, college of engineering, department of engineering science

a special class of cubic graphs are the cycle permutation graphs. a cycle permutation graph pn( α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.in this paper we determine a good upper bound for tenacity of cycle permutation graphs.

Journal: :iranian journal of fuzzy systems 0
xiaonan li school of mathematics and statistics, xidian university, xi'an, 710071, shaanxi, china huangjian yi school of information and technology, northwest university, xi'an, 710069, shaanxi, china

matroids are important combinatorial structures and connect close-lywith graphs. matroids and graphs were all generalized to fuzzysetting respectively. this paper tries to study  connections betweenfuzzy matroids and fuzzy graphs. for a given fuzzy graph, we firstinduce a sequence of matroids  from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. a fuzzy matroid, named graph fuzzy matro...

Journal: :iranian journal of optimization 2009
m. taleghani y. modabbernia

this article proposes an optimization model for preventing the waste of time in the educational and research activities' cycle of an organization such as a university. for this purpose and in order to increase efficiency and prevent the waste of time; the graph theory models have been used. the educational and research activities diagrams of a supposed university is drawn by the use of graphs t...

A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...

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

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