Advanced Search
Article Contents
Article Contents

Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs

Abstract Related Papers Cited by
  • Consider a connected, undirected graph $G=(V,E)$ and an integer $r \geq 1$; for any vertex $v\in V$, let $B_r(v)$ denote the ball of radius $r$ centred at $v$, i.e., the set of all vertices linked to $v$ by a path consisting of at most $r$ edges. If for all vertices $v \in V$, the sets $B_r(v)$ are different, then we say that $G$ is $r$-twin-free.
    In $r$-twin-free graphs, we prolong the study of the extremal values that can be achieved by the main classical parameters in graph theory, and investigate here the number of edges, the minimum degree, the size of a maximum independent set, as well as radius and diameter.
    Mathematics Subject Classification: Primary: 05C99; Secondary: 05C35.


    \begin{equation} \\ \end{equation}
  • 加载中

Article Metrics

HTML views() PDF downloads(111) Cited by(0)

Access History



    DownLoad:  Full-Size Img  PowerPoint