Zobrazeno 1 - 10
of 254
pro vyhledávání: '"Circuit rank"'
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 44:3259-3267
The independence polynomial of a graph G is $$I(G;x)=\sum _{k=0}^{\alpha (G)} s_{k}\cdot x^{k}$$ , where $$s_{k}$$ and $$\alpha (G)$$ denote the number of independent sets of cardinality k and the independence number of G, respectively. We say that a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a4d39132c107ea05b9e10c11abf5d2a
https://doi.org/10.1007/s40840-021-01106-x
https://doi.org/10.1007/s40840-021-01106-x
Autor:
Ioan Tomescu
Publikováno v:
match Communications in Mathematical and in Computer Chemistry. 87:109-114
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76e1df9c32bb29d27db4e65d7817a911
https://doi.org/10.46793/match.87-1.109t
https://doi.org/10.46793/match.87-1.109t
Publikováno v:
Linear Algebra and its Applications. 609:152-162
Let G = ( V ( G ) , E ( G ) ) be a connected graph with vertex set V ( G ) and edge set E ( G ) and let θ ( G ) = | E ( G ) | − | V ( G ) | + 1 be the cyclomatic number of G. If θ ( G ) = 1 , G is called a unicyclic graph. The Laplacian matrix of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::285fc9896e68a5f082d61133ca443aa8
https://doi.org/10.1016/j.laa.2020.09.003
https://doi.org/10.1016/j.laa.2020.09.003
Publikováno v:
Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series. 56:398-407
The concept of (κ,τ)-regular vertex set appeared in 2004. It was proved that the existence of many classical combinatorial structures in a graph like perfect matchings, Hamiltonian cycles, effective dominating sets, etc., can be characterized by (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c0eac1a087ef4aa03d49c823baa9f6a
https://doi.org/10.29235/1561-2430-2020-56-4-398-407
https://doi.org/10.29235/1561-2430-2020-56-4-398-407
Publikováno v:
Researches in Mathematics and Mechanics. 25:7-15
Small vibrations of a graph of fullerene (truncated icosahedron) is considered each edge of which is a so-called Stieltjes string (a massless thread bearing finite number of point masses) symmetric with respect to its midpoint. The spectral problem i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29cedf7faffcab09280d5c10e0fa571b
https://doi.org/10.18524/2519-206x.2020.1(35).221965
https://doi.org/10.18524/2519-206x.2020.1(35).221965
Autor:
Kinkar Chandra Das
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 44:2123-2138
The Balaban index and sum-Balaban index of a connected (molecular) graph G are defined as $$\begin{aligned} J(G)&=\frac{m}{\mu +1} \sum _{uv\in E(G)}\frac{1}{\sqrt{\sigma _{G}(u)\sigma _{G}(v)}}~ \text{ and }\\ SJ(G)&=\frac{m}{\mu +1} \sum _{uv\in E(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21f24ff26dd39e6717c0cc226392b143
https://doi.org/10.1007/s40840-020-01054-y
https://doi.org/10.1007/s40840-020-01054-y
Autor:
Shuchao Li, Ting Yang
Publikováno v:
Linear and Multilinear Algebra. 70:1768-1787
Let G ϕ be an n-vertex complex unit gain graph and let G be its underlying graph. The adjacency rank of G ϕ , written as r ( G ϕ ) , is the rank of its adjacency matrix and denote by α ′ ( G ) the ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6f463b17f05059e10c8404ada5b0ec3
https://doi.org/10.1080/03081087.2020.1776205
https://doi.org/10.1080/03081087.2020.1776205
Publikováno v:
Linear Algebra and its Applications. 594:193-204
Let G = ( V ( G ) , E ( G ) ) be a simple undirected graph with vertex set V ( G ) and edge set E ( G ) . The cyclomatic number of a connected graph G is defined as θ ( G ) = | E ( G ) | − | V ( G ) | + 1 . The A α matrix of a graph G is defined
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::452353849cbefd4a0a4400a87723b459
https://doi.org/10.1016/j.laa.2020.02.025
https://doi.org/10.1016/j.laa.2020.02.025
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 911-914 (2020)
We define three large families of graphs which contain and respectively as subfamily. Necessary and sufficient conditions for those graphs in these three large families whose squares are panconnected are determined.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c24f81f22c218759da5aae5b04d34f2
https://doi.org/10.1016/j.akcej.2020.02.002
https://doi.org/10.1016/j.akcej.2020.02.002
Autor:
Ali Ghalavand, Ali Reza Ashrafi
Publikováno v:
Journal of Applied Mathematics and Computing. 63:707-715
Let G be a graph with vertex set V(G). The total irregularity of G is defined as $$irr_t(G)=\sum _{\{u,v\}\subseteq V(G)}|deg_G(u)-deg_G(v)|$$, where $$deg_G(v)$$ is the degree of the vertex v of G. The cyclomatic number of G is defined as $$c = m -
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0694d786f613fb590eb19e84c818c928
https://doi.org/10.1007/s12190-020-01335-6
https://doi.org/10.1007/s12190-020-01335-6