The class of \(q\)-cliqued graphs: eigen-bi-balanced characteristic, designs, and an entomological experiment

DOI10.1155/2015/152918zbMath1322.05097OpenAlexW2060656337WikidataQ59106869 ScholiaQ59106869MaRDI QIDQ499815

Costas Zachariades, Paul August Winter, Carol Lynne Jessop

Publication date: 6 October 2015

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/152918

zbMATH Keywords

eigenvalueseigen-bi-balanced \(q\)-cliqued graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Integral eigen-pair balanced classes of graphs with their ratio, asymptote, area, and involution-complementary aspects
• The densest \(k\)-subgraph problem on clique graphs
• Inverse of the distance matrix of a block graph
• On the distance matrix of a directed graph

This page was built for publication: The class of \(q\)-cliqued graphs: eigen-bi-balanced characteristic, designs, and an entomological experiment