Search Results - "Javarsineh, Mehrnoosh"

Separating layered treewidth and row treewidth by Bose, Prosenjit, Dujmović, Vida, Javarsineh, Mehrnoosh, Morin, Pat, Wood, David R.

“…Layered treewidth and row treewidth are recently introduced graph parameters that have been key ingredients in the solution of several well-known open…”
Get full text

Unicyclic and bicyclic graphs with exactly three Q-main eigenvalues by Javarsineh, Mehrnoosh, Fath-Tabar, Gholam Hossein

“…Finding all the graphs with a certain number of Q-main eigenvalues is an algebraic graph theory problem that scientists have sought to answer it for many…”
Get full text

On Graphs with Exactly Three 𝑄-main Eigenvalues by Javarsineh, Mehrnoosh, Fath-Tabar, Gholam Hossein

“…For a simple graph 𝐺, the 𝑄-eigenvalues are the eigenvalues of the signless Laplacian matrix 𝑄 of 𝐺. A 𝑄-eigenvalue is said to be a 𝑄-main eigenvalue if…”
Get full text

On graphs with exactly three Q-main eigenvalues by Javarsineh, Mehrnoosh, Fath-Tabar, Gholam

Get full text

Linear versus centred chromatic numbers by Bose, Prosenjit, Dujmović, Vida, Houdrouge, Hussein, Javarsineh, Mehrnoosh, Morin, Pat

“…$\DeclareMathOperator{\chicen}{\chi_{\mathrm{cen}}}\DeclareMathOperator{\chilin}{\chi_{\mathrm{lin}}}$ A centred colouring of a graph is a vertex colouring in…”
Get full text

Separating layered treewidth and row treewidth by Bose, Prosenjit, Dujmović, Vida, Javarsineh, Mehrnoosh, Morin, Pat, Wood, David R

“…Discrete Mathematics & Theoretical Computer Science, vol. 24, no. 1, Graph Theory (May 13, 2022) dmtcs:7458 Layered treewidth and row treewidth are recently…”
Get full text

Asymptotically Optimal Vertex Ranking of Planar Graphs by Bose, Prosenjit, Dujmović, Vida, Javarsineh, Mehrnoosh, Morin, Pat

“…A (vertex) $\ell$-ranking is a colouring $\varphi:V(G)\to\mathbb{N}$ of the vertices of a graph $G$ with integer colours so that for any path $u_0,\ldots,u_p$…”
Get full text