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

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

2017
Tuncay KÖROĞLU Bahadır Özgür GÜLER Zeynep ŞANLI

We investigate suborbital graphs for an imprimitive action of the Atkin–Lehner group on a maximal subset of extended rational numbers on which a transitive action is also satisfied. Obtaining edge and some circuit conditions, we examine some combinatorial properties of these graphs.

Journal: :journal of algebraic system 0
a. alhevaz department of mathematics, shahrood university of technology, p.o. box: 316- 3619995161, shahrood, iran. m. baghipur department of mathematics, shahrood university of technology, p.o. box: 316- 3619995161, shahrood, iran.

‎let $g=(v(g),e(g))$ be a simple connected graph with vertex set $v(g)$ and edge‎ ‎set $e(g)$‎. ‎the (first) edge-hyper wiener index of the graph $g$ is defined as‎: ‎$$ww_{e}(g)=sum_{{f,g}subseteq e(g)}(d_{e}(f,g|g)+d_{e}^{2}(f,g|g))=frac{1}{2}sum_{fin e(g)}(d_{e}(f|g)+d^{2}_{e}(f|g)),$$‎ ‎where $d_{e}(f,g|g)$ denotes the distance between the edges $f=xy$ and $g=uv$ in $e(g)$ and $d_{e}(f|g)=s...

2003
I. J. DEJTER THOMASSEN

Two questions are considered, namely (i) How many colors are needed for a coloring of the n-cube without monochromatic quadrangles or hexagons? We show that four colors suffice and thereby settle a problem of Erdos. (ii) Which vertex-transitive induced subgraphs does a hypercube have? An interesting graph has come up in this context: If we delete a Hamming code from the 7-cube, the resulting gr...

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

Journal: :J. Comput. Syst. Sci. 1997
Edith Cohen

Computing the transitive closure in directed graphs is a fundamental graph problem. We consider the more restricted problem of computing the number of nodes reachable from every node and the size of the transitive closure. The fastest known transitive closure algorithms run in O(min{mn, n2.38}) time, where n is the number of nodes and m the number of edges in the graph. We present an O(m) time ...

2010
Steffen Klamt Robert J. Flassig Kai Sundmacher

MOTIVATION Distinguishing direct from indirect influences is a central issue in reverse engineering of biological networks because it facilitates detection and removal of false positive edges. Transitive reduction is one approach for eliminating edges reflecting indirect effects but its use in reconstructing cyclic interaction graphs with true redundant structures is problematic. RESULTS We p...

Journal: :iranian journal of mathematical chemistry 2013
l. pourfaraj

recently, hua et al. defined a new topological index based on degrees and inverse ofdistances between all pairs of vertices. they named this new graph invariant as reciprocaldegree distance as 1{ , } ( ) ( ( ) ( ))[ ( , )]rdd(g) = u v v g d u  d v d u v , where the d(u,v) denotesthe distance between vertices u and v. in this paper, we compute this topological index forgrassmann graphs.

Journal: :Journal of Applied Mathematics and Physics 2022

Characterizing regular covers of symmetric graphs is one the fundamental topics in field algebraic graph theory, and often a key step for approaching general graphs. Complete graphs, which are typical naturally appear study many as normal quotient In this paper, characterization edge-transitive cyclic complete with prime power order given by using techniques finite group theory related properti...

Journal: :Journal of Graph Theory 1999
Shao-Fei Du Dragan Marusic

A regular and edge transitive graph which is not vertex transitive is said to be semisymmetric Every semisymmetric graph is necessarily bipartite with the two parts having equal size and the automorphism group acting transitively on each of these two parts A semisymmet ric graph is called biprimitive if its automorphism group acts prim itively on each part In this paper a classi cation of bipri...

Journal: :Eur. J. Comb. 2002
Sanming Zhou

We find a natural construction of a large class of symmetric graphs from pointand block-transitive 1-designs. The graphs in this class can be characterized as G-symmetric graphs whose vertex sets admit a G-invariant partition B of block size at least 3 such that, for any two blocks B,C of B, either there is no edge between B and C , or there exists only one vertex in B not adjacent to any verte...

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

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