Add to ORKG[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;不具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0022-247X&DestApp=JCR&RQ=IF_CAT_BOXPLO
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue...
NSFC [10671162]; NSC [95-2115-M-001-023]Motivated by studying the spectra of truncated polyhedra, we...
AbstractMotivated by studying the spectra of truncated polyhedra, we consider the clique-inserted-gr...
The operation of replacing every vertex of an r-regular lattice H by a complete graph of order r is ...
In this paper, we give the relation between the spectrum of strongly regular graph and its clique-in...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;不具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gat...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
The realization graph G(d) role= presentation \u3e of a degree sequence d is the graph whose vertic...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
Many computer vision and patter recognition problems are intimately related to the maximum clique pr...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cg...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue...
NSFC [10671162]; NSC [95-2115-M-001-023]Motivated by studying the spectra of truncated polyhedra, we...
AbstractMotivated by studying the spectra of truncated polyhedra, we consider the clique-inserted-gr...
The operation of replacing every vertex of an r-regular lattice H by a complete graph of order r is ...
In this paper, we give the relation between the spectrum of strongly regular graph and its clique-in...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;不具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gat...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
The realization graph G(d) role= presentation \u3e of a degree sequence d is the graph whose vertic...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
Many computer vision and patter recognition problems are intimately related to the maximum clique pr...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cg...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue...