Results 51 to 60 of about 782,126 (230)
Prime ideal graphs of commutative rings
Indonesian Journal of Combinatorics, 2022 Let R be a finite commutative ring with identity and P be a prime ideal of R. The vertex set is R - {0} and two distinct vertices are adjacent if their product in P. This graph is called the prime ideal graph of R and denoted by ΓP.
Haval Mohammed Salih, Asaad A. Jund
doaj +1 more source
Tiling of Prime and Composite Kirchhoff Graphs
, 2022 A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. We present an algorithm that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. We explore the tiling of prime Kirchhoff graphs.
Wang, Jessica
core +3 more sources
Prime Labeling of H- Super Subdivision of Y-tree Related Graphs
Ratio Mathematica, 2023 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
Neutrosophic Quadratic Residues and Non-Residues [PDF]
Neutrosophic Sets and Systems, 2021 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
The Metric Dimension and Local Metric Dimension of Relative Prime Graph
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2020 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
A distance measure for large graphs based on prime graphs [PDF]
Pattern Recognition, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lagraa, Sofiane +4 more
openaire +5 more sources
Extending Undirected Graph Techniques to Directed Graphs via Category Theory
MathematicsWe use Category Theory to construct a ‘bridge’ relating directed graphs with undirected graphs, such that the notion of direction is preserved. Specifically, we provide an isomorphism between the category of simple directed graphs and a category we call ‘
Sebastian Pardo-Guerra +4 more
doaj +1 more source
Recognition of prime graphs from a prime subgraph
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pierre Ille, Roger Villemaire
openaire +4 more sources
Triangle-free graphs which are minimal for some nonstable 4-vertex subset
Arab Journal of Mathematical Sciences, 2015 In a graph G, a module is a vertex subset M such that every vertex outside M is adjacent to all or none of M. A graph G is prime if ϕ, the single-vertex sets, and V(G) are the only modules in G.
Mohammad Alzohairi
doaj +1 more source
Orbit polynomial graphs of prime order [PDF]
, 1987 We begin with a discussion of orbit polynomial graphs and their relationship with distance-transitive, distance-regular and distance polynomial graphs. After finding a simple classification of the orbit polynomial graphs with a prime number of vertices ...
Beezer, Robert A
core +1 more source