نتایج جستجو برای: strongly triangular graph

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

Journal: :Electr. J. Comb. 2016
Anurag Bishnoi Bart De Bruyn

We construct and study a new near octagon of order (2, 10) which has its full automorphism group isomorphic to the group G2(4) : 2 and which contains 416 copies of the Hall-Janko near octagon as full subgeometries. Using this near octagon and its substructures we give geometric constructions of the G2(4)-graph and the Suzuki graph, both of which are strongly regular graphs contained in the Suzu...

Journal: :Comp. Opt. and Appl. 2012
Francisco J. Aragón Artacho Michaël Gaydu

We consider a generalized version of the proximal point algorithm for solving the perturbed inclusion y ∈ T (x), where y is a perturbation element near 0 and T is a set-valued mapping acting from a Banach space X to a Banach space Y which is metrically regular around some point point (x̄, 0) in its graph. We study the behavior of the convergent iterates generated by the algorithm and we prove th...

2015
Slavko Moconja

We investigate if every quasi-minimal group is abelian, and give a positive answer for a quasi-minimal pure group having a ∅-definable partial order with uncountable chains. We also relate two properties of a complete theory in a countable language: the existence of a quasi-minimal model and the existence of a strongly regular type. As a consequence we derive the equivalence of conjectures on c...

Journal: :Eur. J. Comb. 2007
Chris D. Godsil Sylvia A. Hobart William J. Martin

We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new constructions.

Journal: :Combinatorica 2015
Tao Feng Koji Momihara Qing Xiang

In this paper, we give a construction of strongly regular Cayley graphs and a construction of skew Hadamard difference sets. Both constructions are based on choosing cyclotomic classes in finite fields, and they generalize the constructions given by Feng and Xiang [10, 12]. Three infinite families of strongly regular graphs with new parameters are obtained. The main tools that we employed are i...

Journal: :Eur. J. Comb. 2007
Domingos Moreira Cardoso Charles Delorme Paula Rama

Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable partitions (which are generalizations of equitable partitions) are presented. Furthermore, on the basis of some properties of the adjacency eigenvectors of a graph, a necessary and sufficient condition for the graph to be primitive strongly regular is introduced. c © 2006 Elsevier Ltd. All rights rese...

A. Khotanloo B. Tabatabaie Shourijeh G. H. Esslamzadeh

Let  and  be Banach algebras, ,  and . We define an -product on  which is a strongly splitting extension of  by . We show that these products form a large class of Banach algebras which contains all module extensions and triangular Banach algebras. Then we consider spectrum, Arens regularity, amenability and weak amenability of these products.

Journal: :Axioms 2015
Hewayda ElGhawalby Edwin R. Hancock

In this paper, we investigate the heat kernel embedding as a route to graph representation. The heat kernel of the graph encapsulates information concerning the distribution of path lengths and, hence, node affinities on the graph; and is found by exponentiating the Laplacian eigen-system over time. A Young–Householder decomposition is performed on the heat kernel to obtain the matrix of the em...

Journal: :Theor. Comput. Sci. 2007
L. Sunil Chandran L. Shankar Ram

In this paper, we study the relationship between the Asymmetric Traveling Salesman Problem (ATSP) and the Cycle Cover Problem in terms of the strength of the triangle inequality on the edge costs in the given complete directed graph instance, G = (V, E). The strength of the triangle inequality is captured by parametrizing the triangle inequality as follows. A complete directed graph G = (V, E) ...

2006
Valentin Polishchuk Esther M. Arkin Joseph S. B. Mitchell

We study the Hamiltonian Cycle problem in graphs induced by subsets of the vertices of the tiling of the plane with equilateral triangles. By analogy with grid graphs we call such graphs triangular grid graphs. Following the analogy, we define the class of solid triangular grid graphs. We prove that the Hamiltonian Cycle problem is NPcomplete for triangular grid graphs. We show that with the ex...

200420052006200720082009201020112012201320142015201620172018201920202021202220230100002000030000

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

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