지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 장전수학회 Advanced Studies in Contemporary Mathematics Advanced Studies in Contemporary Mathematics Vol.31 No.4
- 발행연도
- 2021.10
- 수록면
- 445 - 456 (12page)
이용수
초록· 키워드
오류제보하기
Let A(G) be the adjacency matrix of a graph G. Let s(v) denote the row entries of A(G) corresponding to the vertex v of G. The Hamming distance between the strings s(u) and s(v) is the number of positions in which s(u) and s(v) differ. In this paper, we study the Hamming distance between the strings generated by the adjacency matrix of generalised complements of a graph. We also compute sum of Hamming distances between all pairs of strings generated by the adjacency matrix of GPk and GP k(i).
목차
등록된 정보가 없습니다.
참고문헌 (5)
참고문헌 신청
A. B. Ganagi / 2016 / Hamming distance between the strings generated by adjacency matrix of a graph and their sum / Algebra Discrete Math 22:82~93
W. Imrich / 1993 / A simple O(mn) algorithm for recognizing Hamming graphs / Bull. Inst. Combin. Appl 9:45~56
S. Klavˇzar / 2005 / Characterizing subgraphs of Hamming graphs / J. Graph Theory 49:302~312
E. Sampathkumar / 1998 / Complement of a graph: A Generalization / Graphs Combin 14:377~392
E. Sampathkumar / 1998 / Generalized complements of a graph / Indian J. Pure Appl. Math 29:625~639
W. Imrich / 1993 / A simple O(mn) algorithm for recognizing Hamming graphs / Bull. Inst. Combin. Appl 9:45~56
S. Klavˇzar / 2005 / Characterizing subgraphs of Hamming graphs / J. Graph Theory 49:302~312
E. Sampathkumar / 1998 / Complement of a graph: A Generalization / Graphs Combin 14:377~392
E. Sampathkumar / 1998 / Generalized complements of a graph / Indian J. Pure Appl. Math 29:625~639
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Directed strongly regular graphs and their codes
대한수학회보
2017 .01
-
Algebraic Method for Characteristic Edge-Zagreb and Laplacian Polynomials of Graphs
Advanced Studies in Contemporary Mathematics
2020 .01
-
Degree distance index of generalized complements of graphs
Proceedings of the Jangjeon Mathematical Society
2023 .01
-
COMPARISON AMONG SEVERAL ADJACENCY PROPERTIES FOR A DIGITAL PRODUCT
호남수학학술지
2015 .01
-
EDGE-ADJACENCY IN GRAPHS
Proceedings of the Jangjeon Mathematical Society
2018 .01
-
Some Properties of q-Distance Energy
Advanced Studies in Contemporary Mathematics
2020 .01
-
Spectra of F-sum graphs and F-product graphs
Proceedings of the Jangjeon Mathematical Society
2018 .01
-
ON CERTAIN ENERGIES OF A ONE-POINT UNION OF COMPLETE GRAPHS Kn Κn
Proceedings of the Jangjeon Mathematical Society
2018 .01
-
INVERSE SUM INDEG ENERGY OF A GRAPH
Advanced Studies in Contemporary Mathematics
2021 .01
-
고함량 식물성 단백질 소재를 이용한 대체 햄 개발
동아시아식생활학회지
2023 .04
-
Status Sum Eigenvalues and Energy of Graphs
Advanced Studies in Contemporary Mathematics
2020 .01
-
Some New Results on Seidel Equienergetic Graphs
Kyungpook Mathematical Journal
2019 .01
-
Graph Equations Involving Tensor Product of Graphs
Kyungpook Mathematical Journal
2017 .06
-
SOME RECURRENCE RELATIONS FOR THE ENERGY OF CYCLE AND PATH GRAPHS
Proceedings of the Jangjeon Mathematical Society
2018 .01
-
[COSMIC STRINGS] 우주의 끈들
BBC 사이언스
2024 .09
-
Distance-Regular Graphs with Valency k, Diameter D≥3 and at Most Dk+1 Vertices
Kyungpook Mathematical Journal
2024 .09
-
STRONGLY REGULAR GRAPHS OVER WEAK METRIC SCHEMES AND CHEEGER CONSTANTS OF HAMMING GRAPHS
Proceedings of the Jangjeon Mathematical Society
2017 .01
-
Independent Transversal Dominating Energy of a Graph
Advanced Studies in Contemporary Mathematics
2021 .04
-
Fibonacci Graph and its Energies
Advanced Studies in Contemporary Mathematics
2021 .01
-
On co-well covered graphs
대한수학회논문집
2020 .01
이 논문의 저자 정보
최근 본 자료
댓글(0)
0