31–40 of 114 results.

• Cofinite Graphs and Their Profinite Completions Download
  Amrita Acharyya • Jon M. Corson • Bikash Das
  description Journal article public Electronic Journal of Graph Theory and Applications • 2017 English
  We generalize the idea of cofinite groups, due to B. Hartley, [2]. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions.The ...
• Spanning K-ended Trees of 3-regular Connected Graphs Download
  Hamed Ghasemian Zoeram • Daniel Yaqubi
  description Journal article public Electronic Journal of Graph Theory and Applications • 2017 English
  A vertex of degree one is called an end-vertex and the set of end-vertices of G is denoted by End(G). For a positive integer k, a tree T be called k-ended tree if $|End(T)| \leq k$. In this paper, we ...
• Bounds for the Laplacian Spectral Radius of Graphs Download
  Kamal Lochan Patra • Binod Kumar Sahoo
  description Journal article public Electronic Journal of Graph Theory and Applications • 2017 English
  This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian matrix, known as the Laplacian spectral radius, of a graph. The bounds are given as functions of graph ...
• A Note on Extreme Sets Download
  Radosław Cymer
  description Journal article public Electronic Journal of Graph Theory and Applications • 2017 English
  In decomposition theory, extreme sets have been studied extensively due to its connection to perfect matchings in a graph. In this paper, we first define extreme sets with respect to degree-matchings ...
• Inverse Graphs Associated with Finite Groups Download
  Monther Rashed Alfuraidan • Yusuf F. Zakariya
  description Journal article public Electronic Journal of Graph Theory and Applications • 2017 English
  Let $(\Gamma,*)$ be a finite group and $S$ a possibly empty subset of $\Gamma$ containing its non-self-invertible elements. In this paper, we introduce the inverse graph associated with $\Gamma$ whose...
• Some New Graceful Generalized Classes of Diameter Six Trees Download
  Debdas Mishra • Sushant Kumar Rout • Puma Chandra Nayak
  description Journal article public Electronic Journal of Graph Theory and Applications • 2017 English
  Here we denote a {\it diameter six tree} by $(c; a_{1}, a_{2}, \ldots, a_{m}; b_{1}, b_{2}, \ldots, b_{n}; c_{1}, c_{2}, \ldots, c_{r})$, where $c$ is the center of the tree; $a_{i}, i = 1, 2, \ldo...
• All Trees Are Six-cordial Download
  Keith Driscoll • Elliot Krop • Michelle Nguyen
  description Journal article public Electronic Journal of Graph Theory and Applications • 2017 English
  For any integer $k>0$, a tree $T$ is $k$-cordial if there exists a labeling of the vertices of $T$ by $\mathbb{Z}_k$, inducing edge-weights as the sum modulo $k$ of the labels on incident vertices ...
• A Note on the Edge Roman Domination in Trees Download
  Nader Jafari Rad
  description Journal article public Electronic Journal of Graph Theory and Applications • 2017 English
  A subset $X$ of edges of a graph $G$ is called an \textit{edgedominating set} of $G$ if every edge not in $X$ is adjacent tosome edge in $X$. The edge domination number $\gamma'(G)$ of $G$ is the mini...
• On the Spectrum of a Class of Distance-transitive Graphs Download
  Seyed Morteza Mirafzal • Ali Zafari
  description Journal article public Electronic Journal of Graph Theory and Applications • 2017 English
  Let $\Gamma=Cay(\mathbb{Z}_n, S_k)$ be the Cayley graph on the cyclic additive group $\mathbb{Z}_n$ $(n\geq 4),$ where $S_1=\{1, n-1\}$, \dots , $S_k=S_ {k-1}\cup\{k, n-k\}$ are the inverse-closed s...
• The Eccentric-distance Sum of Some Graphs Download
  Padmapriya P. • Veena Mathad
  description Journal article public Electronic Journal of Graph Theory and Applications • 2017 English
  Let $G = (V,E)$ be a simple connected graph. Theeccentric-distance sum of $G$ is defined as$\xi^{ds}(G) =\ds\sum_{\{u,v\}\subseteq V(G)} [e(u)+e(v)] d(u,v)$, where $e(u)$ %\dsis the eccentricity of th...