مقاله‌ی دسترسی آزاد

A Study On Set-Graphs

JohanKok, K.P. Chithra, N.K. Sudev, C.Susanth

دانلود متن کاملرایگان، با حساب کاربری؛ ثبت نام با گوگل چند ثانیه است

چکیده(به انگلیسی؛ چکیده‌ی فارسی در دسترس نیست)

A primitive hole of a graph G is a cycle of length 3 in G.The number of primitive holes in a given graph G is called the primitive hole number of that graph G.The primitive degree of a vertex v of a given graph G is the number of primitive holes incident on the vertex v.In this paper, we introduce the notion of set-graphs and study the properties and characteristics of set-graphs.We also check the primitive hole number of a set-graph and the primitive degree of its vertices.Interesting introductory results on the nature of order of set-graphs, degree of the vertices corresponding to subsets of equal cardinality, the number of largest complete subgraphs in a set-graph etc. are discussed in this study.A recursive formula to determine the primitive hole number of a set-graph is also derived in this paper.

نویسندگان و وابستگی سازمانی
  1. JohanKok
  2. K.P. ChithraORCID 0000-0003-3871-1345 — Naduvath Mana , Nandikkara Thrissur- 680301 , India
  3. N.K. SudevORCID 0000-0001-9692-4053 — Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara , Thrissur- 680501 , India
  4. C.Susanth — Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara , Thrissur- 680501 , India

اسناد مشابه

  • Set Graphs. V. On representing graphs as membership digraphs

    سند علمی۲۰۱۵J. Log. Comput.Eugenio G. Omodeo, Alexandru I. Tomescu

    An undirected graph is commonly represented as a set of vertices and a set of doubletons of vertices; but one can also represent vertices by finite sets so as to ensure that membership mimics, over those sets, the edge relation of the graph. This alternative modeling, applied to

  • ar X iv : 1 20 7 . 71 84 v 1 [ cs . D M ] 3 1 Ju l 2 01 2 Set graphs . II . Complexity of set graph recognition and similar problems

    سند علمی۲۰۱۲Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, Andrej Marušič

    A graph G is said to be a set graph if it admits an acyclic orientation that is also extensional, in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the digraph representation of a hereditarily finit

  • Set graphs. II. Complexity of set graph recognition and similar problems

    سند علمی۲۰۱۴Theor. Comput. Sci.Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu

    A graph G is said to be a set graph if it admits an acyclic orientation that is also extensional, in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the digraph representation of a hereditarily finit

  • An autonomous distributed control method based on tie-set graph theory in future grid

    سند علمی۲۰۱۳I. J. Circuit Theory and ApplicationsKiyoshi Nakayama, Norihiko Shinomiya, Hitoshi Watanabe

    In future power grids where electricity flows bidirectionally, the essential problem is to maximize the total efficiency of distributed energy resources. In complicated and large-scale systems such as modern power distribution networks, maximizing the efficiency of the entire sys

  • Set Graphs VI: Logic Programming and Bisimulation

    سند علمی۲۰۱۴CILCAgostino Dovier

    We analyze the declarative encoding of the set-theoretic graph property known as bisimulation. This notion is of central importance in non-well founded set theory, semantics of concurrency, model checking, and coinductive reasoning. From a modeling point of view, it is particular

  • Set graphs. I. Hereditarily finite sets and extensional acyclic orientations

    مقاله‌ی دسترسی آزاد۲۰۱۳Discrete Applied MathematicsMartinMilanič, Alexandru I.Tomescu