Open AccessBook
Distance in graphs
Fred Buckley,Frank Harary +1 more
About:
The article was published on 1990-01-01 and is currently open access. It has received 1185 citations till now. The article focuses on the topics: Graph theory & Convexity.read more
Citations
More filters
Problema de particionamento em subgrafos complementares: complexidade e convexidade
TL;DR: In this paper, the authors introduce the problem of Particao EM SUBGRAFOS COMPLEMENTARES (COMP-======¯¯¯¯SUB(Pi)), which generalizes o problem of reconhecimento dos prismas complementares.
Dissertation
Two-fold isomorphisms
TL;DR: In this article, a generalization of the notion of isomorphism from a graph or digraph G to a graph and a digraph H is presented, namely two-fold isomorphisms from G to H. The concept of TF-isomorphism was introduced by Marušič, Scapellato and Zagaglia-Salvi.
Journal ArticleDOI
Forcing total outer connected monophonic number of a graph
TL;DR: In this paper , the forcing total outer connected monophonic number of a connected graph was studied and the bounds for it were established for a certain class of graphs, and it was shown that for every pair of positive integers with 0 (cid:54) 𝑎 < ǫ < � and � = � + 4, there exists a connected graphs such that �, � is the cardinality of a minimum forcing total inner connected monphonic subset of a graph.
Journal ArticleDOI
Independent strong domination in complementary prisms
TL;DR: The independent strong domination in complementary prisms is considered, the complementary pr prism GĠ of G is the graph formed from the disjoint union of G and Ġ by adding the edges of a perfect matching between the corresponding vertices of G, and the relationship betweenindependent strong domination number and the distance-based parameters is investigated.
A Note On Strongly Quotient Graphs With Harary Energy And Harary Estrada Index
TL;DR: In this article, the upper and lower bounds on Harary energy and Harary Estrada index on Strongly Quotient Graphs (SQG) were investigated.