scholarly journals CHARACTERISTICS OF SHACKLE GRAPH: Shack(Kn,v(j,i),t), Shack(Sn,v(j,i),t), & Shack(K(n,n),v(rj,i),t)

2021 ◽  
Vol 10 (2) ◽  
pp. 125
Author(s):  
Firmansyah Firmansyah ◽  
Abdul Mujib
Keyword(s):  
Natural Numbers ◽  
Chromatic Numbers ◽  
Product Graph

<p class="AfiliasiCxSpFirst" align="left"><strong>Abstrak:</strong></p><p class="AfiliasiCxSpMiddle">Operasi schackle adalah operasi antara dua atau lebih graf yang menghasilkan graf baru. Graf shackle dinotasikan  adalah graf yang dihasilkan dari t salinan dari graf  yang diberi simbol dengan  dimana  dan t bilangan asli. Operasi shackle ppada penelitian ini adalah shackle titik. Operasi shackle titik dinotasikan dengan  artinya graf yang dibangun dari sembarang graf  sebanyak  salinan dan titik  sebagai . Kelas graf yang akan di eksporasi karakterisinya dan bilangan kromatinya adalah <em>, S</em> <em>, &amp; S</em> . Hasil penelitiannya menunjukkan bahwa bilangan kromatik graf shackle sama dengan subgraf pembangunnya.</p><p class="AfiliasiCxSpMiddle" align="left"> </p><p class="AfiliasiCxSpLast" align="left"><strong>Kata Kunci</strong>:</p><p>Operasi Shackle, Shackle titik, graf shackle, bilangan kromatik.</p><p> </p><p class="AfiliasiCxSpFirst" align="left"><strong><em>Abstract:</em></strong></p><p class="AfiliasiCxSpMiddle"><em>A shackle operation is an operation between two or more graphs that results in a new graph. Shackle graph notated </em> <em> </em><em>is a product graph from </em> <em> copy of graph </em> <em> is denoted by </em> <em> where </em> <em> and </em> <em> are natural numbers. The shackle operation in this research is vertex shackle. Vertex shackle operation is denoted by </em> <em> which means that the graph is constructed from any graph </em> <em> as many as </em> <em> copies and vertex </em> <em> as linkage vertex. The class of graphs examined in this study are </em> <em>, S</em> <em>, &amp; S</em> <em>.</em> <em>The results show that the ch</em><em>r</em><em>omatic number of the shackle graph is the same as the subgraph that generates it</em><em>.</em></p><p class="AfiliasiCxSpMiddle" align="left"> </p><p class="AfiliasiCxSpLast" align="left"><strong><em>Keywords</em></strong><em>:</em></p><p><em>Shackle Operation, Vertex Shackle, Shackle Graph</em><em>, Chromatic Numbers.</em></p>

The Argument from (Natural) Numbers

2018 ◽  
Author(s):  
Tyron Goldschmidt
Keyword(s):  
Natural Numbers ◽  
Existence Of God ◽  
Divine Attribute ◽  
Rule Out

This chapter considers Plantinga’s argument from numbers for the existence of God. Plantinga sees divine psychologism as having advantages over both human psychologism and Platonism. The chapter begins with Plantinga’s description of the argument, including the relation of numbers to any divine attribute. It then argues that human psychologism can be ruled out completely. However, what rules it out might rule out divine psychologism too. It also argues that the main problem with Platonism might also be a problem with divine psychologism. However, it will, at the least, be less of a problem. In any case, there are alternative, possibly viable views about the nature of numbers that have not been touched by Plantinga’s argument. In addition, the chapter touches on the argument from properties, and its relation to the argument from numbers.

The Natural Numbers

2018 ◽  
Author(s):  
Øystein Linnebo
Keyword(s):  
Natural Number ◽  
Peano Arithmetic ◽  
Number Sequence ◽  
Natural Numbers ◽  
Ordinal Numbers ◽  
Cardinal Numbers

How are the natural numbers individuated? That is, what is our most basic way of singling out a natural number for reference in language or in thought? According to Frege and many of his followers, the natural numbers are cardinal numbers, individuated by the cardinalities of the collections that they number. Another answer regards the natural numbers as ordinal numbers, individuated by their positions in the natural number sequence. Some reasons to favor the second answer are presented. This answer is therefore developed in more detail, involving a form of abstraction on numerals. Based on this answer, a justification for the axioms of Dedekind–Peano arithmetic is developed.

Asymptotics with remainder term for moments of the total cycle number of random A-permutation

2021 ◽  
Vol 31 (1) ◽  
pp. 51-60
Author(s):  
Arsen L. Yakymiv
Keyword(s):  
Remainder Term ◽  
Random Permutation ◽  
Natural Numbers ◽  
Cycle Number ◽  
Fixed Set ◽  
Cycle Lengths

Abstract Dedicated to the memory of Alexander Ivanovich Pavlov. We consider the set of n-permutations with cycle lengths belonging to some fixed set A of natural numbers (so-called A-permutations). Let random permutation τ n be uniformly distributed on this set. For some class of sets A we find the asymptotics with remainder term for moments of total cycle number of τ n .

scholarly journals The set chromatic numbers of the middle graph of graphs

2021 ◽  
Vol 1836 (1) ◽  
pp. 012014
Author(s):  
G R J Eugenio ◽  
M J P Ruiz ◽  
M A C Tolentino
Keyword(s):  
Chromatic Numbers ◽  
Middle Graph

Ideal convergent sequence spaces of fuzzy star–shaped numbers

2021 ◽  
pp. 1-8
Author(s):  
Vakeel A. Khan ◽  
Umme Tuba ◽  
SK. Ashadul Rahama ◽  
Ayaz Ahmad
Keyword(s):  
Fuzzy Sets ◽  
Convergent Sequence ◽  
Sequence Spaces ◽  
Topological Properties ◽  
Natural Numbers

In 1990, Diamond [16] primarily established the base of fuzzy star–shaped sets, an extension of fuzzy sets and numerous of its properties. In this paper, we aim to generalize the convergence induced by an ideal defined on natural numbers ℕ , introduce new sequence spaces of fuzzy star–shaped numbers in ℝ n and examine various algebraic and topological properties of the new corresponding spaces as well. In support of our results, we provide several examples of these new resulting sequences.

scholarly journals k-Zumkeller labeling of super subdivision of some graphs

2021 ◽  
Vol 29 (1) ◽  
Author(s):  
M. Basher
Keyword(s):  
Simple Graph ◽  
Natural Numbers ◽  
Injective Function ◽  
Planar Grid ◽  
Circular Ladder

AbstractA simple graph $$G=(V,E)$$ G = ( V , E ) is said to be k-Zumkeller graph if there is an injective function f from the vertices of G to the natural numbers N such that when each edge $$xy\in E$$ x y ∈ E is assigned the label f(x)f(y), the resulting edge labels are k distinct Zumkeller numbers. In this paper, we show that the super subdivision of path, cycle, comb, ladder, crown, circular ladder, planar grid and prism are k-Zumkeller graphs.

PAL – Propositional Algorithmic Logic

1981 ◽  
Vol 4 (3) ◽  
pp. 675-760
Author(s):  
Grażyna Mirkowska
Keyword(s):  
Data Structures ◽  
Completeness Theorem ◽  
Natural Numbers ◽  
First Order ◽  
Algorithmic Logic ◽  
Axiomatic Systems ◽  
Nondeterministic Program ◽  
Basic Sets

The aim of propositional algorithmic logic is to investigate the properties of program connectives. Complete axiomatic systems for deterministic as well as for nondeterministic interpretations of program variables are presented. They constitute basic sets of tools useful in the practice of proving the properties of program schemes. Propositional theories of data structures, e.g. the arithmetic of natural numbers and stacks, are constructed. This shows that in many aspects PAL is close to first-order algorithmic logic. Tautologies of PAL become tautologies of algorithmic logic after replacing program variables by programs and propositional variables by formulas. Another corollary to the completeness theorem asserts that it is possible to eliminate nondeterministic program variables and replace them by schemes with deterministic atoms.

Sign in / Sign up

Export Citation Format

Share Document