Results 41 to 50 of about 33,385 (288)

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, Sajana Shaik, Florentin Smarandache   +2 more
doaj   +1 more source

On prime Cayley graphs

Journal of Combinatorics
The decomposition of complex networks into smaller, interconnected components is a central challenge in network theory with a wide range of potential applications.
Mináč, Ján, Cizek, Michal, Spirkl, Sophie, Crew, Logan, Nguyen, Tung T., Tân, Nguyên Duy, Chudnovsky, Maria   +6 more
core   +2 more sources

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, Fatmawati Fatmawati, Mohammad Imam Utoyo   +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, Seba, Hamida, Khennoufa, Riadh, Mbaya, Abir, Kheddouci, Hamamache   +4 more
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

Dominating sets and domination polynomials of certain graphs, II [PDF]

Opuscula Mathematica, 2010
The domination polynomial of a graph \(G\) of order \(n\) is the polynomial \(D(G,x) = \sum _{i=\gamma(G)}^n d(G,i)x^i\), where \(d(G,i)\) is the number of dominating sets of \(G\) of size \(i\), and \(\gamma (G)\) is the domination number of \(G\).
Saeid Alikhani, Yee-hock Peng
doaj   +1 more source

Extending Undirected Graph Techniques to Directed Graphs via Category Theory

Mathematics
We 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, Vivek Kurien George, Vikash Morar, Joshua Roldan, Gabriel Alex Silva   +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   +3 more sources

A new characterization of the automorphism groups of Mathieu groups

Open Mathematics, 2021
Let cd(G){\rm{cd}}\left(G) be the set of irreducible complex character degrees of a finite group GG. ρ(G)\rho \left(G) denotes the set of primes dividing degrees in cd(G){\rm{cd}}\left(G).
Liu Xin, Chen Guiyun, Yan Yanxiong
doaj   +1 more source

Exhaustive Enumeration of Spatial Prime Structures

Machines
Prime structures are link chains with 0 DoF (degrees of freedom), not including subchains with 0 or fewer DoF, which are expected to be used in systematic kinematic and dynamic analyses of link mechanisms.
Takahiro Aruga, Nobuyuki Iwatsuki
doaj   +1 more source