Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorPriya, P. Devien_US
dc.contributor.authorMonikandan, S.en_US
dc.date.accessioned2021-01-13T08:40:06Z
dc.date.available2021-01-13T08:40:06Z
dc.date.issued2021
dc.identifier.citationPriya, P. D. & Monikandan, S. (2021). Stronger reconstruction of distance-hereditary graphs. TWMS Journal of Applied and Engineering Mathematics, 11(SI), 25-29.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/3017
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/109-vol11-special-issue/631
dc.description.abstractA graph is said to be set-reconstructible if it is uniquely determined up to isomorphism from the set S of its non-isomorphic one-vertex deleted unlabeled subgraphs. Harary’s conjecture asserts that every finite simple undirected graph on four or more vertices is set-reconstructible. A graph G is said to be distance-hereditary if for all connected induced subgraph F of G, dF (u, v) = dG(u, v) for every pair of vertices u, v ? V (F). In this paper, we have proved that the class of all 2-connected distance-hereditary graphs G with diam(G) = 2 or diam(G) = diam(?) = 3 are set-reconstructible.en_US
dc.description.sponsorshipThe second author is supported by the University Grants Commission, Government of India. (F./2017-18/NFO-2017-18-OBC-TAM-53159)en_US
dc.language.isoenen_US
dc.publisherIşık University Pressen_US
dc.relation.ispartofTWMS Journal of Applied and Engineering Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectSet-reconstructionen_US
dc.subjectConnectivityen_US
dc.subjectDistanceen_US
dc.subjectDistance-hereditaryen_US
dc.titleStronger reconstruction of distance-hereditary graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume11
dc.identifier.issueSI
dc.identifier.startpage25
dc.identifier.endpage29
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess