NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 2 of 2 (0.025 seconds)

Spelling suggestions: "subject:"bootable cographs"" "subject:"bootable bigraphs""

1

K-Independence Stable Graphs Upon Edge Removal

Chellali, Mustapha, Haynes, Teresa W., Volkmann, Lutz 01 January 2010 (has links)
Let k be a positive integer and G = (V (G),E(G)) a graph. A subset S of V (G) is a k-independent set of G if the subgraph induced by the vertices of S has maximum degree at most k-1. The maximum cardinality of a k-independent set of G is the k-independence number βk(G). A graph G is called βk- -stable if βk(G - e) = βk(G) for every edge e of E(G). First we give a necessary and sufficient condition for βk--stable graphs. Then we establish four equivalent conditions for βk--stable trees.
k-independence
k-independence stable graphs
Mathematics and Statistics
2

Enumeration of Stable Graphs

Dillon, Kane 25 May 2022 (has links)
No description available.
Mathematics
Graph Theory
Algebra
Topology
Stable Graphs
Metric Graphs
Euler Characteristic

Page generated in 0.0286 seconds