2021
DOI: 10.3934/math.2021270
|View full text |Cite
|
Sign up to set email alerts
|

Structures of power digraphs over the congruence equation $ x^p\equiv y\; (\text{mod}\; m) $ and enumerations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 18 publications
0
9
0
Order By: Relevance
“…In this section, we elaborate the concept of cubic residue graph and then characterize these graphs completely for each positive integer n. e disjoint union of the graphs H and K is expressed by H⊕K, and the disjoint union of the n copies of the graph K is denoted as nK � K⊕K⊕ 4,5,7,8,10,11,13,14,16,17,19,20,22,23,25 1.…”
Section: Cubic Residues Graphsmentioning
confidence: 99%
See 1 more Smart Citation
“…In this section, we elaborate the concept of cubic residue graph and then characterize these graphs completely for each positive integer n. e disjoint union of the graphs H and K is expressed by H⊕K, and the disjoint union of the n copies of the graph K is denoted as nK � K⊕K⊕ 4,5,7,8,10,11,13,14,16,17,19,20,22,23,25 1.…”
Section: Cubic Residues Graphsmentioning
confidence: 99%
“…Mahmood and Ahmad proposed many new results of graphs over residues modulo prime powers in [10,11]. Mateen and Mahmood investigated the structure of power digraphs associated with the congruence x n ≡ y(mod m) and x n ≡ y n (mod m) in [12][13][14][15]. In [16], Wei and Tang introduced the concept of square mapping graphs of the Gaussian ring Z n [i].…”
Section: Introductionmentioning
confidence: 99%
“…e study of the topological index is started by the formulation of the Wiener index [8]. Different topological applications have been found in [9][10][11][12][13][14]. For a graph G, a degree-dependent topological index is defined as…”
Section: Introductionmentioning
confidence: 99%
“…The diagraph Γ(n, 11) is called symmetric if its set of components can be split into two sets in such a way that there exists a bijection between these two sets such that the corresponding digraph are isomorphic. Moreover, if n is an arbitrary natural number and f is a polynomial with the integer coefficients, then the function [7]). Lemma 3.1 The numbers 0, 1 & (n−1) are fixed points of Γ(n, 11).…”
Section: Structure and Properties Of The Digraph γ(N 11)mentioning
confidence: 99%
“…In this paper, the author has determined the number of fixed points and discussed the structure of Γ(n, 5) for n = 2 k & 5 k , where k is a natural number. In 2019 [6], M. Haris Mateen et al discussed the digraph Γ(n, 7) in association with the congruence a 7 ≡ b(mod n) and gave the explicit formula of fixed points. In the same paper, the author also discussed the condition for which the digraph Γ(n, 7) has exactly 7 components.…”
Section: Introductionmentioning
confidence: 99%