Author:
Tapeing Aziz B.,Laja Ladznar S.
Abstract
A graph $G$ is co-segregated if $\text{deg}_G(x)=\text{deg}_G(y),$ then $xy \in E(G)$. The co-segregated polynomial of a graph $G$ of order $n$ is given by $CoS(G,x)=\sum_{k=1}^{n}C(k)x^k$, where $C(k)$ is the number of co-segregated subgraphs of $G$ of order $k$. We characterize a co-segregated subgraph of a graph and also of a graph under some binary operations. Using these characterizations, we obtain co-segregated polynomials of such graphs.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. WEAKLY PANCYCLIC POLYNOMIAL OF A GRAPH;Advances and Applications in Discrete Mathematics;2024-02-24
2. ON CONVEX SUBGRAPH POLYNOMIALS AND SOME OF ITS IMPORTANT VALUES;Advances and Applications in Discrete Mathematics;2024-01-05
3. CONVEX SUBGRAPH POLYNOMIALS OF DEGREE 3 OR 4, ROOTED AND CO-NORMAL PRODUCTS OF GRAPHS;Advances and Applications in Discrete Mathematics;2023-12-09
4. TOTALLY SEGREGATED POLYNOMIAL OF GRAPHS;Advances and Applications in Discrete Mathematics;2023-11-21