نتایج جستجو برای: connected graphs

تعداد نتایج: 208797  

Journal: :transactions on combinatorics 2015
r. b. bapat sivaramakrishnan sivasubramanian

let $a = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrixwhere $n geq 2$. let $dt(a)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$. let $g$ be a connected graph with blocks $b_1, b_2, ldots b_p$ and with$q$-exponential distance matrix $ed_g$. we given an explicitformula for $dt(ed_g)$ which shows that $dt(ed_g)$ is independent of the manner in ...

Journal: :Journal of Combinatorial Theory, Series B 2002

Journal: :Discrete Mathematics 1994

Journal: :Advances in Applied Mathematics 2016

Journal: :Discrete Mathematics 1987

Journal: :Electronic Journal of Graph Theory and Applications 2021

Journal: :Journal of Combinatorial Theory, Series B 1984

Journal: :Discrete Applied Mathematics 2014

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید