Let G be a connected reductive p-adic group and let g be its Lie algebra. LetO be a G-orbit in g. Then the orbital integral μO corresponding to O is an invariant distribution on g, and Harish-Chandra proved that its Fourier transform μ̂O is a locally constant function on the set g′ of regular semisimple elements of g. Furthermore, he showed that a normalized version of the Fourier transform is l...

the colorful paths and rainbow paths have been considered by severalauthors.a colorful directed path in a digraph $g$ is a directed path with $chi(g)$ vertices whose colors are different. a $v$-colorful directed path is such a directed path, starting from $v$. we prove that for a given $3$-regular triangle-free digraph $g$ determining whether there is a proper $chi(g)$-coloring of $g$such that ...

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...

Let $G$ be a non-abelian group. The non-commuting graph $Gamma_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joined if and only if they do not commute.In this paper we study some properties of $Gamma_G$ and introduce $n$-regular $AC$-groups. Also we then obtain a formula for Szeged index of $Gamma_G$ in terms of $n$, $|Z(G)|$ and $|G|...

A graph whose edges are labeled either as positive or negative is called a signed graph. A signed graph is said to be net-regular if every vertex has constant net-degree k, namely, the difference between the number of positive and negative edges incident with a vertex. In this paper, we analyze some properties of co-regular signed graphs which are net-regular signed graphs with the underlying g...

Let $G$ be a simple connected graph. In this paper, Szeged dimension and PI$_v$ dimension of graph $G$ are introduced. It is proved that if $G$ is a graph of Szeged dimension $1$ then line graph of $G$ is 2-connected. The dimensions of five composite graphs: sum, corona, composition, disjunction and symmetric difference with strongly regular components is computed. Also explicit formulas of Sze...

A digraph G is called primitive if for some positive integer k, there is a walk of length exactly k from each vertex u to each vertex v (possibly u again). If G is primitive, the smallest such k is called the exponent of G, denoted by exp(G). A digraph G is said to be r-regular if each vertex in G has outdegree and indegree exactly r. It is proved that if G is a primitive 2-regular digraph with...

A P -decomposition of a graph G is a set of pairwise edge-disjoint paths of G with edges that cover the edge set of G. Kotzig (1957) proved that a 3-regular graph admits a P3-decomposition if and only if it contains a perfect matching, and also asked what are the necessary and sufficient conditions for an -regular graph to admit a P -decomposition, for odd . Let g, and m be positive integers wi...

‎in this paper some properties of weak regular injectivity for $s$-posets‎, ‎where $s$ is a pomonoid‎, ‎are studied‎. ‎the behaviour‎ ‎of different kinds of weak regular injectivity with products‎, ‎coproducts and direct sums is considered‎. ‎also‎, ‎some‎ ‎characterizations of pomonoids over which all $s$-posets are of‎ ‎some kind of weakly regular injective are obtained‎. ‎further‎, ‎we‎ ‎giv...

Let G be a strongly connected digraph with distance matrix D(G) and let Tr(G) the diagonal vertex transmissions of G. For any real ? [0, 1], define D?(G) as = ?Tr(G) + (1-?)D(G). The D? spectral radius is D?(G). In this paper, we first give some upper lower bounds for characterize extremal digraphs. Moreover, digraphs that are not transmission regular, bound on difference between maximum radius...