نتایج جستجو برای: edge transitive graph
تعداد نتایج: 297196 فیلتر نتایج به سال:
We study transitivity properties of edge weights in complex networks. We show that enforcing transitivity leads to a transitivity inequality which is equivalent to ultra-metric inequality. This can be used to define transitive closure on weighted undirected graphs, which can be computed using a modified Floyd-Warshall algorithm. These new concepts are extended to dissimilarity graphs and triang...
an acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. the acyclic chromatic index of a graph $g$ denoted by $chi_a '(g)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. the maximum degree in $g$ denoted by $delta(g)$, is the lower bound for $chi_a '(g)$. $p$-cuts introduced in this paper acts as a powerfu...
It is proved that the Wiener index of a weighted graph (G, w) can be expressed as the sum of the Wiener indices of weighted quotient graphs with respect to an arbitrary combination of Θ∗-classes. Here Θ∗ denotes the transitive closure of the Djoković-Winkler’s relation Θ. A related result for edge-weighted graphs is also given and a class of graphs studied in [19] is characterized as partial cu...
The k-th semi total point graph of a graph G, , is a graph obtained from G by adding k vertices corresponding to each edge and connecting them to the endpoints of edge considered. In this paper, a formula for Laplacian polynomial of in terms of characteristic and Laplacian polynomials of G is computed, where is a connected regular graph.The Kirchhoff index of is also computed.
Abstract A finite simple graph $$\Gamma $$ Γ is called a Nest if it regular of valency 6 and admits an automorphism with two orbits the same length such that at least one subgraphs induced by these cycle. In this paper, we complete classification edge-transitive graphs solve problem posed Jajcay et al. (Elect...
A graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-regular if its automorphism group acts regularly on the set of s-arcs of Γ. Tutte (1947, 1959) showed that every cubic finite symmetric cubic graph is s-regular for some s ≤ 5. Djokovič and Miller (1980) proved that there are seven types of arc-transitive group action on finite cubic graphs, characterised...
Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which are edgebut not vertex-transitive). In particular, the Gray graph arises as the medial layer graph of a certain universal locally toroidal regular 4-polytope.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید