Cargando…

The Smallest Spectral Radius of Graphs with a Given Clique Number

The first four smallest values of the spectral radius among all connected graphs with maximum clique size ω ≥ 2 are obtained.

Detalles Bibliográficos
Autores principales:	Zhang, Jing-Ming, Huang, Ting-Zhu, Guo, Ji-Ming
Formato:	Online Artículo Texto
Lenguaje:	English
Publicado:	Hindawi Publishing Corporation 2014
Materias:	Research Article
Acceso en línea:	https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4121196/ https://www.ncbi.nlm.nih.gov/pubmed/25121112 http://dx.doi.org/10.1155/2014/232153

Ejemplares similares

On the Signless Laplacian Spectral Radius of Bicyclic Graphs with Perfect Matchings
por: Zhang, Jing-Ming, et al.
Publicado: (2014)

Spectral radius of graphs
por: Stevanovic, Dragan
Publicado: (2015)

Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs
por: Banderier, Cyril, et al.
Publicado: (2020)

Monochromatic Clique Decompositions of Graphs
por: Liu, Henry, et al.
Publicado: (2015)

Bounds of the Spectral Radius and the Nordhaus-Gaddum Type of the Graphs
por: Wang, Tianfei, et al.
Publicado: (2013)

Clustering cliques for graph-based summarization of the biomedical research literature
por: Zhang, Han, et al.
Publicado: (2013)

Computing a maximum clique in geometric superclasses of disk graphs
por: Grelier, Nicolas
Publicado: (2022)

Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs
por: Fan, Yi, et al.
Publicado: (2023)

On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
por: Lehmann, Katharina A, et al.
Publicado: (2006)

On the characterization of claw-free graphs with given total restrained domination number
por: Pi, Xiaoming
Publicado: (2016)

Chromosomal cliques
por: Dove, Alan W.
Publicado: (2002)

Communities as cliques
por: Fried, Yael, et al.
Publicado: (2016)

A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum
por: Cloteaux, Brian
Publicado: (2018)

On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
por: Phillips, Charles A., et al.
Publicado: (2019)

Cliques, coloring, and satisfiability
por: Johnson, David S, et al.
Publicado: (1996)

Quantum Clique Gossiping
por: Li, Bo, et al.
Publicado: (2018)

Why the Spectral Radius? An intuition-building introduction to the basic reproduction number
por: Brouwer, Andrew F.
Publicado: (2022)

Excluding infinite clique minors
por: Robertson, Neil, et al.
Publicado: (1995)

Cliques and cavities in the human connectome
por: Sizemore, Ann E., et al.
Publicado: (2017)

Normalized lmQCM: An Algorithm for Detecting Weak Quasi-Cliques in Weighted Graph with Applications in Gene Co-Expression Module Discovery in Cancers
por: Zhang, Jie, et al.
Publicado: (2016)

Some inequalities on the spectral radius of matrices
por: Zhao, Linlin, et al.
Publicado: (2018)

An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops
por: Azam, Naveed Ahmed, et al.
Publicado: (2020)

Simulating accurate and effective solutions of some nonlinear nonlocal two-point BVPs: Clique and QLM-clique matrix methods
por: Izadi, Mohammad, et al.
Publicado: (2023)

XcisClique: analysis of regulatory bicliques
por: Pati, Amrita, et al.
Publicado: (2006)

MFOC-CliqueNet: A CliqueNet-Based Optimal Combination of Multidimensional Features Classification Method for Large-Scale Laser Point Clouds
por: Wang, Lei, et al.
Publicado: (2022)

Machine to smash the smallest
Publicado: (1965)

Bounds for the Z-spectral radius of nonnegative tensors
por: He, Jun, et al.
Publicado: (2016)

The topology of the directed clique complex as a network invariant
por: Masulli, Paolo, et al.
Publicado: (2016)

Pairwise correlation graphs from hippocampal population activity have highly non-random, low-dimensional clique topology
por: Curto, Carina, et al.
Publicado: (2013)

Smallest near-infrared fluorescent protein evolved from cyanobacteriochrome as versatile tag for spectral multiplexing
por: Oliinyk, Olena S., et al.
Publicado: (2019)

Maximal Clique Based Influence Maximization in Networks
por: Mhadhbi, Nizar, et al.
Publicado: (2020)

An Iterated Tabu Search Approach for the Clique Partitioning Problem
por: Palubeckis, Gintaras, et al.
Publicado: (2014)

Viral Quasispecies Assembly via Maximal Clique Enumeration
por: Töpfer, Armin, et al.
Publicado: (2014)

TAD cliques predict key features of chromatin organization
por: Liyakat Ali, Tharvesh M., et al.
Publicado: (2021)

A new bound for the spectral radius of nonnegative tensors
por: Li, Suhua, et al.
Publicado: (2017)

Classification of minimal graphs with given Abelian automorphism group
por: Arlinghaus, William C
Publicado: (1985)

Efficient enumeration of monocyclic chemical graphs with given path frequencies
por: Suzuki, Masaki, et al.
Publicado: (2014)

An upper bound for the Z-spectral radius of adjacency tensors
por: Wu, Zhi-Yong, et al.
Publicado: (2018)

On the spectral radius and energy of signless Laplacian matrix of digraphs
por: Ganie, Hilal A., et al.
Publicado: (2022)

Amino-Acid Network Clique Analysis of Protein Mutation Non-Additive Effects: A Case Study of Lysozyme
por: Ming, Dengming, et al.
Publicado: (2018)

Cannot write session to /tmp/vufind_sessions/sess_a9apl0amt76fbush2kcavh7nuv