PELABELAN TOTAL SISI AJAIB SUPER PADA GRAF TERHUBUNG 3-REGULER
نویسندگان
چکیده
. Suatu pelabelan total sisi ajaib pada graf G dengan p titik dan q adalah suatu fungsi bijektif f : V (G) ∪ E(G) → {1, 2, 3, · , + q} sedemikian sehingga f(u) f(v) f(uv) = k, untuk setiap uv ∈ k konstanta bilangan bulat positif. dikatakan sebagai super jika p}. Pada penulisan ini dikaji tentang terhubung 3-reguler.Kata Kunci: Pelabelan graf, reguler,
منابع مشابه
Super Vertex-magic Total Labelings of Graphs
Let G be a finite simple graph with v vertices and e edges. A vertex-magic total labeling is a bijection λ from V (G)∪E(G) to the consecutive integers 1, 2, · · · , v+e with the property that for every x ∈ V (G), λ(x) + Σy∈N(x)λ(xy) = k for some constant k. Such a labeling is super if λ(V (G)) = {1, · · · , v}. We study some of the basic properties of such labelings, find some families of graph...
متن کاملSubanta pada analyzer for Sanskrit
Natural language processing has wide coverage in application areas like machine translation , text to speech conversion , semantic analysis , semantic role labeling and knowledge representation .Morphological and syntactic processing are components of NLP which process each word to produce the syntactic structure of the sentence, with respect to its grammar .Semantic analysis follows syntactic ...
متن کاملSuper-Fast 3-Ruling Sets
A t-ruling set of a graph G = (V,E) is a vertex-subset S ⊆ V that is independent and satisfies the property that every vertex v ∈ V is at a distance of at most t from some vertex in S. A maximal independent set (MIS) is a 1-ruling set. The problem of computing an MIS on a network is a fundamental problem in distributed algorithms and the fastest algorithm for this problem is the O(logn)-round a...
متن کاملLAF/GrAF-grounded Representation of Dependency Structures
This paper shows that a LAF/GrAF-based annotation schema can be used for the adequate representation of syntactic dependency structures in many languages. We first argue that there are at least two types of textual units that can be annotated with dependency information: words/tokens and chunks/phrases. Based on this consideration, we discuss a sub-typing of GrAF to represent the corresponding ...
متن کاملM ay 2 00 3 SIGNIFICANCE OF LOG - PERIODIC SIGNATURES IN CUMULATIVE NOISE HANS - CHRISTIAN GRAF
Using methods introduced by Scargle we derive a cumulative version of the Lomb periodogram that exhibits frequency independent statistics when applied to cumulative noise. We show how this cumulative Lomb periodogram allows us to estimate the significance of log-periodic signatures in the S&P 500 anti-bubble that started in August 2000.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Matematika Unand
سال: 2021
ISSN: ['2721-9410', '2303-291X']
DOI: https://doi.org/10.25077/jmu.10.1.38-45.2021