Cover Image

The row left rank of a quaternion unit gain graph in terms of maximum degree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lu, Yong, Shen, Qi
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The row left rank of quaternion unit gain graphs in terms of pendant vertices
by: Lu, Yong, et al.
Published: (2025)

The left row rank of quaternion unit gain graphs in terms of girth
by: Lu, Yong, et al.
Published: (2024)

A bound on the girth of quaternion unit gain graphs in terms of the rank
by: Khan, Suliman, et al.
Published: (2024)

Improved bounds on the $H$-rank of a mixed graph in terms of the matching number and fractional matching number
by: Wu, Qi, et al.
Published: (2025)

Symmetry in complex unit gain graphs and their spectra
by: Wissing, Pepijn, et al.
Published: (2023)

Nonregular graphs with a given maximum degree attaining maximum spectral radius
by: Huang, Zejun, et al.
Published: (2024)

Injective edge-coloring of graphs with small maximum degree
by: Huang, Danjun, et al.
Published: (2025)

On the Borodin--Kostochka conjecture for graphs with large maximum degree
by: Liu, Feng, et al.
Published: (2026)

The maximum degree of the $r$th power of a sparse random graph
by: Frieze, Alan, et al.
Published: (2024)

On graphs with chromatic number and maximum degree both equal to nine
by: Galindo, Rachel, et al.
Published: (2024)

Spectral properties of distance Laplacian matrices of complex unit gain graphs
by: Samanta, Aniruddha, et al.
Published: (2025)

Total coloring graphs with large maximum degree
by: Dalal, Aseem, et al.
Published: (2024)

On the maximum degree of induced subgraphs of the Kneser graph
by: Chau, Hou Tin, et al.
Published: (2023)

A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree
by: Wang, Yichen, et al.
Published: (2024)

The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
by: Zhang, Leilei
Published: (2024)

Injective edge-coloring of claw-free graphs with maximum degree 4
by: Huang, Danjun, et al.
Published: (2025)

Antimagic labelling of graphs with maximum degree $Δ(G) = n - 4$
by: Beaudoire, Grégoire, et al.
Published: (2026)

The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)

Between proper and square colorings of planar graphs with maximum degree at most four
by: Liu, Xujun, et al.
Published: (2026)

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)

Some sufficient conditions for a graph with minimum degree to be $k$-critical with respect to $[1,b]$-odd factors
by: Zhong, Jiaxu, et al.
Published: (2026)

Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical
by: Zhong, Jiaxu, et al.
Published: (2026)

A sufficient condition for planar graphs with maximum degree eight to be totally 9-colorable
by: Deniz, Zakir, et al.
Published: (2025)

Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

Complete polyhedral description of chemical graphs of maximum degree at most 3
by: Dusollier, Valentin, et al.
Published: (2025)

On the maximum $σ$-irregularity of trees with given order and maximum degree
by: Bašić, Milan
Published: (2026)

Hypergraph independence bounds: from maximum degree to average degree
by: Yu, Jing, et al.
Published: (2026)

Majority additive coloring and the maximum degree
by: Brause, Christoph, et al.
Published: (2025)

2-distance 20-coloring of planar graphs with maximum degree 6
by: Aoki, Kengo
Published: (2024)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

On the maximum second eigenvalue of outerplanar graphs
by: Brooks, George, et al.
Published: (2023)

Gain distance Laplacian matrices for complex unit gain graphs
by: Khan, Suliman
Published: (2024)

Distance signless Laplacian spectral radius and tough graphs involving minimun degree
by: Liu, Xiangge, et al.
Published: (2025)

Flexible list coloring of graphs with maximum average degree less than $3$
by: Bi, Richard, et al.
Published: (2023)

On 2-distance 16-coloring of planar graphs with maximum degree at most five
by: Deniz, Zakir
Published: (2023)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

Identifying codes in triangle-free graphs of bounded maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

The maximum number of cliques in disjoint copies of graphs
by: Gao, Zhipeng, et al.
Published: (2025)

Maximal and maximum induced matchings in connected graphs
by: Yuan, Bo-Jun, et al.
Published: (2024)

The maximum number of maximum dissociation sets in potted graphs
by: Huang, Zejun, et al.
Published: (2024)