<p>Topology can be constructed using a collection known as a subbasis or basis with remarkable characteristics. Recently, there has been growing interest in the problem of reconstructing topology from graph vertices, which involves concepts such as incident, adjacent, block, and maximal-block topologies. This paper introduces the new concept of graph-induced topology, which extends the idea of topologies derived from connected simple undirected graphs. The paper thoroughly examines various properties related to separation axioms in graph-induced topological spaces and introduces a novel concept of weak-separation axioms for these topological spaces. The presented properties are supported by rigorous mathematical arguments and accompanied by apparent counterexamples to illustrate their validity.</p>