watching systems of triangular graphs
نویسندگان
چکیده
a watching system in a graph $g=(v, e)$ is a set $w={omega_{1}, omega_{2}, cdots, omega_{k}}$, where $omega_{i}=(v_{i}, z_{i}), v_{i}in v$ and $z_{i}$ is a subset of closed neighborhood of $v_{i}$ such that the sets $l_{w}(v)={omega_{i}: vin omega_{i}}$ are non-empty and distinct, for any $vin v$. in this paper, we study the watching systems of line graph $k_{n}$ which is called triangular graph and denoted by $t(n)$. the minimum size of a watching system of $g$ is denoted by $omega(g)$. we show that $omega(t(n))=lceilfrac{2n}{3}rceil$.
منابع مشابه
Watching Systems in graphs: an extension of Identifying Codes
We introduce the notion of watching systems in graphs, which is a generalization of that of identifying codes. We give some basic properties of watching systems, an upper bound on the minimum size of a watching system, and results on the graphs which achieve this bound; we also study the cases of the paths and cycles, and give complexity results.
متن کاملLocal Properties of Triangular Graphs
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many various occasions. They model processor networks in which local computations can be easily implemented. The main issue addressed in the paper is to characterize class of triangular graphs (defined globally) by local m...
متن کاملTriangular embeddings of complete graphs
In this paper we describe the generation of all nonorientable triangular embeddings of the complete graphs K12 and K13. (The 59 nonisomorphic orientable triangular embeddings of K12 were found in 1996 by Altshuler, Bokowski and Schuchert, and K13 has no orientable triangular embeddings.) There are 182, 200 nonisomorphic nonorientable triangular embeddings for K12, and 243, 088, 286 for K13. Tri...
متن کاملSampling Eulerian orientations of triangular lattice graphs
We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm studied here is more natural in the context of planar Eulerian graphs. We analyse the mixing time of a Markov chain on the Eulerian orientations of a planar gra...
متن کاملHamiltonian properties of triangular grid graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-connected, linearly convex triangular grid graphs (with the exception of one of them) are hamiltonian. The only exception is a graph D which is the linearlyconvex hull of the Star of David. We extend this result to a wider...
متن کاملOn the Shannon Capacity of Triangular Graphs
The Shannon capacity of a graph G is c(G) = supd>1(α(G d)) 1 d , where α(G) is the independence number of G. The Shannon capacity of the Kneser graph KGn,r was determined by Lovász in 1979, but little is known about the Shannon capacity of the complement of that graph when r does not divide n. The complement of the Kneser graph, KGn,2, is also called the triangular graph Tn. The graph Tn has th...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
transactions on combinatoricsناشر: university of isfahan
ISSN 2251-8657
دوره 3
شماره 1 2014
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023