51–60 of 114 results.

• About the Second Neighborhood Problem in Tournaments Missing Disjoint Stars Download
  Salman Fawzi Ghazal
  description Journal article public Electronic Journal of Graph Theory and Applications • 2016 English
  Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for di...
• Enumeration for Spanning Trees and Forests of Join Graphs Based on the Combinatorial Decomposition Download
  Sung Sik U.
  description Journal article public Electronic Journal of Graph Theory and Applications • 2016 English
  This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs $K_m+H_n$ and $K_m+K_{n,p}$, where $H_n$ is a graph with $n$ isolated vertices.
• A Graph Theoretical Analysis of the Number of Edges in K-dense Graphs Download
  Linda Eroh • Henry Escuadro • Ralucca Gera • Samuel Prahlow • Karl Schmitt
  description Journal article public Electronic Journal of Graph Theory and Applications • 2016 English
  Due to the increasing discovery and implementation of networks within all disciplines of life, the study of subgraph connectivity has become increasingly important. Motivated by the idea of community ...
• Twin Edge Colorings of Certain Square Graphs and Product Graphs Download
  R. Rajarajachozhan • R. Sampathkumar
  description Journal article public Electronic Journal of Graph Theory and Applications • 2016 English
  A twin edge $k\!$-coloring of a graph $G$ is a proper edge $k$-coloring of $G$ with the elements of $\mathbb{Z}_k$ so that the induced vertex $k$-coloring, in which the color of a vertex $v$ in $G$ is...
• A Note on Isolate Domination Download
  Ismail Sahul Hamid • S. Balamurugan • A. Navaneethakrishnan
  description Journal article public Electronic Journal of Graph Theory and Applications • 2016 English
  A set $S$ of vertices of a graph $G$ such that $\left\langle S\right\rangle$ has an isolated vertex is called an \emph{isolate set} of $G$. The minimum and maximum cardinality of a maximal isolate set...
• Constructing Arbitrarily Large Graphs with a Specified Number of Hamiltonian Cycles Download
  Michael Haythorpe
  description Journal article public Electronic Journal of Graph Theory and Applications • 2016 English
  A constructive method is provided that outputs a directed graph which is named a broken crown graph, containing $5n-9$ vertices and $k$ Hamiltonian cycles for any choice of integers $n \geq k \geq 4$....
• Bounds on Weak and Strong Total Domination in Graphs Download
  M. H. Akhbari • Nader Jafari Rad
  description Journal article public Electronic Journal of Graph Theory and Applications • 2016 English
  A set $D$ of vertices in a graph $G=(V,E)$ is a total dominatingset if every vertex of $G$ is adjacent to some vertex in $D$. Atotal dominating set $D$ of $G$ is said to be weak if everyvertex $v\in V...
• Routed Planar Networks Download
  David J. Aldous
  description Journal article public Electronic Journal of Graph Theory and Applications • 2016 English
  Modeling a road network as a planar graph seems very natural. However, in studying continuum limits of such networks it is useful to take {\em routes} rather than {\em edges} as primitives. This artic...
• Spectra of the Extended Neighborhood Corona and Extended Corona of Two Graphs Download
  Chandrashekar Adiga • Rakshith B. R. • K.N., Subba Krishna
  description Journal article public Electronic Journal of Graph Theory and Applications • 2016 English
  In this paper we define extended corona and extended neighborhoodcorona of two graphs $G_{1}$ and $G_{2}$, which are denoted by$G_{1}\bullet G_{2}$ and $G_{1}\ast G_{2}$ respectively. Wecompute their ...
• Chromatically Unique 6-bridge Graph Theta(a,a,a,b,b,c) Download
  N. S. A. Karim • Roslan Hasni • Gee-Choon Lau
  description Journal article public Electronic Journal of Graph Theory and Applications • 2016 English
  For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromaticall...