# A Study on Edge-Set Graphs of Certain Graphs

Source: [A Study on Edge-Set Graphs of Certain Graphs](<https://www.sota2.com/research/paper/68fa5a9a1e209131ce9c13b3>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T16:35:48.631Z

Authors: Johan Kok, N.K. Sudev, K.P. Chithra

Published: 2015-07-08T05:38:15.000Z

## Abstract

Let $G(V, E)$ be a simple connected graph, with $\|E\| = \\epsilon.$ In this paper, we define an edge-set graph $\\mathcal G\_G$ constructed from the graph $G$ such that any vertex $v\_{s,i}$ of $\\mathcal G\_G$ corresponds to the $i$-th $s$-element subset of $E(G)$ and any two vertices $v\_{s,i}, v\_{k,m}$ of $\\mathcal G\_G$ are adjacent if and only if there is at least one edge in the edge-subset corresponding to $v\_{s,i}$ which is adjacent to at least one edge in the edge-subset corresponding to $v\_{k,m}$ where $s,k$ are positive integers. It can be noted that the edge-set graph $\\mathcal G\_G$ of a graph $G$ id dependent on both the structure of $G$ as well as the number of edges $\\epsilon.$ We also discuss the characteristics and properties of the edge-set graphs corresponding to certain standard graphs.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1507.02546>)

[PDF](<https://arxiv.org/pdf/1507.02546.pdf>)
