منابع مشابه
Graph Searching on Chordal Graphs
In the graph searching problem initially a graph with all edges contaminated is pre sented We would like to obtain a state of the graph in which all edges are simultaneously clear by a sequence of moves using searchers The objective is to achieve the desired state by using the least number of searchers Two variations of the graph searching problem are considered in this paper One is the edge se...
متن کاملZagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs
Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.
متن کاملLine graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کاملThe leafage of a chordal graph
The leafage l(G) of a chordal graph G is the minimum number of leaves of a tree in which G has an intersection representation by subtrees. We obtain upper and lower bounds on l(G) and compute it on special classes. The maximum of l(G) on n-vertex graphs is n − lg n− 1 2 lg lg n+O(1). The proper leafage l(G) is the minimum number of leaves when no subtree may contain another; we obtain upper and...
متن کاملOn Mutually Orthogonal Graph-Path Squares
A decomposition { } s G G G − = 0 1 1 , , , of a graph H is a partition of the edge set of H into edgedisjoint subgraphs s G G G − 0 1 1 , , , . If i G G ≅ for all { } i s ∈ − 0,1, , 1 , then is a decomposition of H by G. Two decompositions { } n G G G − = 0 1 1 , , , and { } n F F F − = 0 1 1 , , , of the complete bipartite graph n n K , are orthogonal if, ( ) ( ) i j E G F =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2018
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.02.013