Results 41 to 50 of about 1,529,529 (310)
On congruence equations arising from suborbital graphs [PDF]
In this paper we deal with congruence equations arising from suborbital graphs of the normalizer of Γ_0(m) in PSL(2,R) . We also propose a conjecture concerning the suborbital graphs of the normalizer and the related congruence equations.
Beşenk, Murat +2 more
core +2 more sources
On the power graphs of elementary abelian and extra special $p$-groups [PDF]
For a given odd prime $p$, we investigate the power graphs of three classes of finite groups: the elementary abelian groups of exponent $p$, and the extra special groups of exponents $p$ or $p^2$. We show that these power graphs are Eulerian for
Masoud Pourhasan, Hossein Doostie
doaj +1 more source
Strongly Regular Graphs Constructed from $p$-ary Bent Functions [PDF]
In this paper, we generalize the construction of strongly regular graphs in [Y. Tan et al., Strongly regular graphs associated with ternary bent functions, J. Combin.Theory Ser.
Chee Yin, De Zhang, Tan Xian, Yeow Meng
core +1 more source
Prime Labeling of H- Super Subdivision of Y-tree Related Graphs
A graph G with p points is called a prime labeling , if it possible to label the points x 2 V with distinct labels f(x) from f1;2; :::; pg in such a way that for each line e = uv gcd (f(u); f(v)) = 1 .
Meena S, Gajalakshmiy G
doaj +1 more source
Co-prime order graphs of finite Abelian groups and dihedral groups [PDF]
The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime. In this paper,
Amit Sehgal, Manjeet, Dalip Singh
semanticscholar +1 more source
Neutrosophic Quadratic Residues and Non-Residues [PDF]
In this paper, we present the Neutrosophic quadratic residues and nonresidues with their basic interpretation as graphs in an algebraic manner and analog to the algebraic graphs.
Chalapathi Tekuri +2 more
doaj +1 more source
An odd prime labeling is a variation of a prime labeling in which the vertices of a graph of order~$n$ are labeled with the distinct odd integers $1$ to $2n-1$ so that the labels of adjacent vertices are relatively prime. This paper investigates many different classes of graphs including disjoint unions of cycles, stacked prisms, and particular types ...
Carter, Holly, Fox, N. Bradley
openaire +2 more sources
Chebyshev Action on Finite Fields [PDF]
Given a polynomial f and a finite field F one can construct a directed graph where the vertices are the values in the finite field, and emanating from each vertex is an edge joining the vertex to its image under f.
Gassert, T. Alden
core +1 more source
Higher Order Evaluation of the Critical Temperature for Interacting Homogeneous Dilute Bose Gases [PDF]
We use the nonperturbative linear \delta expansion method to evaluate analytically the coefficients c_1 and c_2^{\prime \prime} which appear in the expansion for the transition temperature for a dilute, homogeneous, three dimensional Bose gas given by ...
A. Duncan +44 more
core +3 more sources
The Metric Dimension and Local Metric Dimension of Relative Prime Graph
This study aims to determine the value of metric dimensions and local metric dimensions of relative prime graphs formed from modulo integer rings, namely . As a vertex set is and if and are relatively prime.
Inna Kuswandari +2 more
doaj +1 more source

