2019
DOI: 10.22190/fumi1901101s
|View full text |Cite
|
Sign up to set email alerts
|

Tensor Product of the Power Graphs of Some Finite Rings

Abstract: Suppose R is a ring. The multiplicative power graph P(R) of R is the graphwhose vertices are elements of R, where two distinct vertices x and y are adjacent if and only if there exists a positive integer n such that x^n = y or y^n = x. In this paper, the tensor product of the power graphs of some nite rings and also some main properties of them will be studied.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
0
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 7 publications
0
0
0
Order By: Relevance
“…Representing the minutiae as nodes and connecting them with edges, based on their proximity or spatial relationships allows the construction of a graph for each fingerprint sample. Various graph-based algorithms and techniques from graph theory can then be utilized to measure the similarity or dissimilarity between the two graphs, indicating the degree of match between the fingerprint samples [46], [47]. The general stages of a fingerprint are shown in Figure 4.…”
Section: Identification Methodsmentioning
confidence: 99%
“…Representing the minutiae as nodes and connecting them with edges, based on their proximity or spatial relationships allows the construction of a graph for each fingerprint sample. Various graph-based algorithms and techniques from graph theory can then be utilized to measure the similarity or dissimilarity between the two graphs, indicating the degree of match between the fingerprint samples [46], [47]. The general stages of a fingerprint are shown in Figure 4.…”
Section: Identification Methodsmentioning
confidence: 99%
“…An illustration of the architecture of the proposed method is presented in Figure ??. The dataset used for experimental purposes was downloaded from the University of California Irvine (UCI) repository [29]. This dataset consists of 3772 samples, with 3481 samples belonging to the healthy group, 194 samples belonging to the hypothyroidism category, 95 samples belonging to the primary hypothyroidism category, and 2 cases belonging to the secondary hypothyroidism category.…”
Section: Proposed Methodsmentioning
confidence: 99%
“…By representing the data instances as nodes and their relationships as edges, graph-based feature extraction [28] methods can capture the structural information and connectivity patterns in the data. These extracted features can be used to enhance the classification performance on imbalanced data [29].…”
Section: Proposed Methodsmentioning
confidence: 99%