Sizes and transmissions of digraphs with a given clique number

• Akiyama J, Frankl P (1985) On the size of graphs with complete factors. J Graph Theory 9:197–201

  Article  MathSciNet  MATH  Google Scholar 

• Bondy JA, Murty USR (2008) Graph theory, GTM 244. Springer, Berlin

  Book  MATH  Google Scholar 

• Huang Z, Zhan X (2012) Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths. Discret Math 312:2203–2213

  Article  MathSciNet  MATH  Google Scholar 

• Huang Z, Zhan X (2011) Digraphs that have at most one walk of a given length with the same endpoints. Discret Math 311:70–79

  Article  MathSciNet  MATH  Google Scholar 

• Joubert EJ (2013) Maximum sizes of graphs with given restrained domination numbers. Discret Appl Math 161:829–837

  Article  MathSciNet  MATH  Google Scholar 

• Li S, Song Y (2014) On the sum of all distances in bipartite graphs. Discret Appl Math 169:176–185

  Article  MathSciNet  MATH  Google Scholar 

• Plesník Ján (1984) On the sum of all distances in a graph or digraph. J Graph Theory 8:1–21

  Article  MathSciNet  MATH  Google Scholar 

• Sanchis LA (1991) Maximum number of edges in connected graphs with a given domination number. Discret Math 87:65–72

  Article  MathSciNet  MATH  Google Scholar 

• Sanchis LA (2000) On the number of edges in graphs with a given connected domination number. Discret Math 214:193–210

  Article  MathSciNet  MATH  Google Scholar 

• Vizing VG (1965) A bound on the external stability number of a graph. Dokl Akad Nauk SSSR 164:729–731

  MathSciNet  Google Scholar 

• Volkmann L (2004) The maximum size of graphs with a unique \(k\)-factor. Combinatorica 24:531–540

  Article  MathSciNet  MATH  Google Scholar 

Download references