DSpace Repository

Browsing Matematik by Subject "Graph theory; vulnerability; thorn graph; independence; domination; exponential independence; complex networks"

Browsing Matematik by Subject "Graph theory; vulnerability; thorn graph; independence; domination; exponential independence; complex networks"

Sort by: Order: Results:

  • Aytac, Aysun; Ciftci, Canan (WORLD SCIENTIFIC PUBL CO PTE LTD, 5 TOH TUCK LINK, SINGAPORE 596224, SINGAPORE, 2018)
    Let G be a graph and S subset of V(G). We define by < S > the subgraph of G induced by S. For each vertex u is an element of S and for each vertex v is an element of S\{u}, d((G, s\{u})())(u,v) is the length of the shortest ...

Search DSpace


Advanced Search

Browse

My Account