نتایج جستجو برای: edge transitive graphs

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

1999
Johanne Cohen Pierre Fraigniaud Cyril Gavoille

Knödel graphs and Fibonacci graphs are two classes of bipartite incident-graph of circulant digraphs. Both graphs have been extensively studied for the purpose of fast communications in networks, and they have deserved a lot of attention in this context. In this paper, we show that there exists an O(n log n)-time algorithm to recognize Knödel graphs, and that the same technique applies to Fibon...

Journal: :journal of algebraic systems 2015
saeid alikhani sommayeh jahari

let $g$ be a simple graph of order $n$ and size $m$.the edge covering of $g$ is a set of edges such that every vertex of $g$ is incident to at least one edge of the set. the edge cover polynomial of $g$ is the polynomial$e(g,x)=sum_{i=rho(g)}^{m} e(g,i) x^{i}$,where $e(g,i)$ is the number of edge coverings of $g$ of size $i$, and$rho(g)$ is the edge covering number of $g$. in this paper we stud...

Journal: :journal of algorithms and computation 0
m. e. abdel-aal department of mathematics, benha univeristy, el-shaheed farid nada, banha, qalyubia 13511, egypt s. minion department of mathematics, clayton state university, morrow, georgia 30260, usa c. barrientos department of mathematics, clayton state university, morrow, georgia 30260, usa. d. williams department of mathematics, clayton state university, morrow, georgia 30260, usa.

mean labelings are a type of additive vertex labeling. this labeling assigns non-negative integers to the vertices of a graph in such a way that all edge-weights are different, where the weight of an edge is defined as the mean of the end-vertex labels rounded up to the nearest integer. in this paper we focus on mean labelings of some graphs that are the result of the corona operation. in parti...

Journal: :Australasian J. Combinatorics 1991
Cheryl E. Praeger

In Remark it was asked the ¢-l (i) were finite for a certain transitive directed with finite in-or The theorem shows that the answer to this ,-,".<><:1",.,-vn is 'no' when the in-and out-valencies are finite but unequal.

Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...

2013
Cheryl E. Praeger Alice C. Niemeyer

The theory of vertex-transitive graphs has developed in parallel with the theory of transitive permutation groups. In this chapter we explore some of the ways the two theories have influenced each other. On the one hand each finite transitive permutation group corresponds to several vertex-transitive graphs, namely the generalised orbital graphs which we shall discuss below. On the other hand, ...

Journal: :Journal of Graph Theory 2015
M. J. Dunwoody B. Krön

Given a connected graph, in many cases it is possible to construct a structure tree that provides information about the ends of the graph or its connectivity. For example Stallings’ theorem on the structure of groups with more than one end can be proved by analyzing the action of the group on a structure tree and Tutte used a structure tree to investigate finite 2-connected graphs, that are not...

Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...

Journal: :Australasian J. Combinatorics 2004
Jun-Ming Xu Qi Liu

The 2-restricted edge-connectivity λ′′ of a graph G is defined to be the minimum cardinality |S| of a set S of edges such thatG−S is disconnected and is of minimum degree at least two. It is known that λ′′ ≤ g(k − 2) for any connected k-regular graph G of girth g other than K4, K5 and K3,3, where k ≥ 3. In this paper, we prove the following result: For a connected vertex-transitive graph of ord...

2008
Cai Heng Li Tian Khoon Lim Cheryl E. Praeger

A factorisation of a complete graph Kn is a partition of its edges with each part corresponding to a spanning subgraph (not necessarily connected), called a factor. A factorisation is called homogeneous if there are subgroups M <G ≤ Sn such that M is vertex-transitive and fixes each factor setwise, and G permutes the factors transitively. We classify the homogeneous factorisations of Kn for whi...

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

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