Skip to content
DraconiticResearch
Search Sources API
194,220 studies31 sourcesUpdated 5 min ago
PreprintCC BY-NC-SA 4.0arXiv

A Common neighborhood signed graph of a signed graph

  • MUKTI ACHARYA
Open at sourcePDFDOICite

Abstract

Let G be a simple connected graph with the vertex set V (G) and the edge set E(G) such that |V (G)| = n and |E(G)| = q. The common neighborhood graph con(G) of G has the same set of vertices as that of G and uv is an edge in con(G) if u and v have at least one common neighbor in G. By a signed graph S, we mean a graph G whose edges has been assigned sign plus or minus. In this paper, the concept of common neighborhood graph has been initiated in the realm of signed graphs, that is, we define a common neighborhood signed graph of a signed graph.

Related

  1. Stationary common-neighborhood properties and partition hypotheses
    Xiang Li
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  2. A planar signed graph with circular chromatic number five
    Lujia Wang, Huan Zhou
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. A Label Noise Robust Algorithm for Graph Data using Neighborhood Label Distribution
    Pintu Kumar, Nandyala Hemachandra
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. Solubility from a disconnected common-divisor graph on p-regular conjugacy-class sizes
    Zhi-Lin Zhang
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  5. A graph reconstruction problem involving common neighbors
    Michela Ascolese, Pietro Negrini, Silvia Maria Carla Pagani +1
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{acharya2026common,
  title = {{A Common neighborhood signed graph of a signed graph}},
  author = {MUKTI ACHARYA},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.25293},
  eprint = {2610.25293},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.25293},
  note = {CC BY-NC-SA 4.0},
}
RIS
TY  - UNPB
TI  - A Common neighborhood signed graph of a signed graph
AU  - MUKTI ACHARYA
PY  - 2026
DA  - 2026/10/18
PB  - arXiv
DO  - 10.48550/arxiv.2610.25293
UR  - https://arxiv.org/abs/2610.25293
AB  - Let G be a simple connected graph with the vertex set V (G) and the edge set E(G) such that |V (G)| = n and |E(G)| = q. The common neighborhood graph con(G) of G has the same set of vertices as that of G and uv is an edge in con(G) if u and v have at least one common neighbor in G. By a signed graph S, we mean a graph G whose edges has been assigned sign plus or minus. In this paper, the concept of common neighborhood graph has been initiated in the realm of signed graphs, that is, we define a common neighborhood signed graph of a signed graph.
ER  -