Results 31 to 40 of about 30,352 (163)
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
Prime Labelings of Snake Graphs
The PUMP Journal of Undergraduate Research, 2019 A prime labeling of a graph G with n vertices is a labeling of the vertices with distinct integers from the set {1, 2 ,..., n} such that the labels of any two adjacent vertices are relatively prime. In this paper, we introduce a snake graph, the fused union of identical cycles, and define a consecutive snake prime labeling for this new family of graphs.
Abigail Bigham +4 more
openaire +2 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
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
Finite prime distance graphs and 2-odd graphs
Discrete Mathematics, 2013 A graph $G$ is a prime distance graph (respectively, a 2-odd graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is prime (either 2 or odd). We prove that trees, cycles, and bipartite graphs are prime distance graphs, and that Dutch windmill graphs and paper mill graphs ...
Laison, Joshua D. +2 more
openaire +3 more sources
On Minimal Prime Graphs and Posets [PDF]
Order, 2009 We show that there are four infinite prime graphs such that every infinite prime graph with no infinite clique embeds one of these graphs. We derive a similar result for infinite prime posets with no infinite chain or no infinite antichain.
Pouzet, Maurice, Zaguia, Imed
openaire +2 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
MachinesPrime 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
THE POWER GRAPH REPRESENTATION FOR INTEGER MODULO GROUP WITH POWER PRIME ORDER
Barekeng, 2023 There are many applications of graphs in various fields. Starting from chemical problems, such as the molecular shape of a compound to internet network problems, we can also use graphs to depict the abstract concept of a mathematical structure..
Lalu Riski Wirendra Putra +4 more
doaj +1 more source