Scholarlink

Let \(V = \left\{ {v_{1} ,v_{2} , \cdots ,v_{n} } \right\}\) be the vertex set such that \(v_{i} = \left( {x_{i} ,y_{i} } \right)\) and \(x_{i}^{2} - dy_{i}^{2} = 1\) for some non-square integer \(d\) . Assume that \(E\) is the set of edges corresponding to the set \(V\) and the adjacency relation is based on divisibility by \(d\) . A graph with the vertex set \(V\) and edge set \(E\) is called a Pseudo Peble Graph. In this paper, we attempt to study Pseudo Peble Graphs for some particular choices of \(d\) .

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Spearhead Instigation on Pseudo Peble Graphs

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • J. Kannan,
  • K. Kaleeswari,
  • M. Mahalakshmi

摘要

Let \(V = \left\{ {v_{1} ,v_{2} , \cdots ,v_{n} } \right\}\) be the vertex set such that \(v_{i} = \left( {x_{i} ,y_{i} } \right)\) and \(x_{i}^{2} - dy_{i}^{2} = 1\) for some non-square integer \(d\) . Assume that \(E\) is the set of edges corresponding to the set \(V\) and the adjacency relation is based on divisibility by \(d\) . A graph with the vertex set \(V\) and edge set \(E\) is called a Pseudo Peble Graph. In this paper, we attempt to study Pseudo Peble Graphs for some particular choices of \(d\) .