the zagreb indices are the oldest graph invariants used in mathematical chemistry to predictthe chemical phenomena. in this paper we define the multiple versions of zagreb indicesbased on degrees of vertices in a given graph and then we compute the first and secondextremal graphs for them.

let $g$ be a connected graph with vertex set $v(g)$‎. ‎the‎ ‎degree resistance distance of $g$ is defined as $d_r(g) = sum_{{u‎,‎v} subseteq v(g)} [d(u)+d(v)] r(u,v)$‎, ‎where $d(u)$ is the degree‎ ‎of vertex $u$‎, ‎and $r(u,v)$ denotes the resistance distance between‎ ‎$u$ and $v$‎. ‎in this paper‎, ‎we characterize $n$-vertex unicyclic‎ ‎graphs having minimum and second minimum degree resista...

1. Introduction. A useful general strategy for the construction of interesting families of vertex-transitive graphs is to begin with some family of transitive permutation groups and to construct for each group T in the family all graphs G whose vertex-set is the orbit V of T and for which T ^ Aut (G), where Aut (G) denotes the automorphism group of G. For example, if we consider the family of c...

We give a simple proof based on symmetries that there are no geodesics from vertex to itself in the cube, tetrahedron, octahedron, and icosahedron.

Greedy routing has drawn a lot of attention in research community. To our best knowledge, stretch factor has not been studied for greedy routing algorithms. In this paper, we propose a new greedy routing algorithm and take the initiative to evaluate its stretch factor. Our algorithm generalizes the algorithm presented in [1]. It embeds an n-vertex connected graph G(V,E) in a semi-metric space. ...

Duty cycle modulation of the alternate blowing from two opposite facing plasma actuators on the leeward surface near the apex of a cone having semi-apex angle of 10° to control the mean lateral force, moment and the flow control mechanisms are presented. The pressure distributions over the cone forebody are measured using steady pressure-tappings. The flowfields are visualized by a two-dimensio...

The source of a simple kG-module, for a finite p-solvable group G and an algebraically closed field k of prime characteristic p, is an endo-permutation module (see [Pu1] or [Th]). L. Puig has proved, more precisely, that this source must be isomorphic to the cap of an endo-permutation module of the form ⊗ Q/R∈S Ten P Q Inf Q Q/R(MQ/R), where MQ/R is an indecomposable torsion endo-trivial module...

The problem of constrained model predictive control on a class of stochastic linear parameter varying systems is discussed. First, constant coefficient matrices are obtained at each vertex in the interior of system, and then, by considering semi-definite programming constraints, weight coefficients between each vertex are calculated, and the equal coefficient matrices for the time variant syste...

Let Y be any commutative association scheme and we fix any vertex x of Y . Terwilleger introduced a non-commutative, associative, and semi-simple C-algebra T = T (x) for Y and x in [4]. We call T the Terwilliger (or subconstituent) algebra of Y with respect to x . Let W (⊂ C|X |) be an irreducible T (x)-module. W is said to be thin if W satisfies a certain simple condition. Y is said to be thin...

This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive graphs as coset graphs. For a coset graph H, an equivalence relation ∼ is defined on the vertices of cosets with classes as double cosets of the stabiliser and a...