EJC 2010 - PDF Preprint Papers

EJC 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EJC-2010 Paper

click to vote

EJC
2010

241views Information Technology» more EJC 2010»

The spread of the unicyclic graphs

13 years 4 months ago

Download www.math.ecnu.edu.cn

Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In this paper, we first investigate the least eigenvalue n(G), then we present two ...

Yarong Wu, Jinlong Shu

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	241	The spread of the unicyclic graphs	claim
2	169	Dualities in full homomorphisms	claim
3	157	Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs	claim
4	155	Connectivity of chamber graphs of buildings and related complexes	claim
5	145	Links in edge-colored graphs	claim
6	137	Bijections for a class of labeled plane trees	claim
7	133	On the infinitesimal rigidity of weakly convex polyhedra	claim
8	131	Inferencing in Database Semantics	claim
9	128	Geometric properties of Assur graphs	claim
10	126	A combinatorial constraint satisfaction problem dichotomy classification conjecture	claim
11	124	Combinatorial characterization of the Assur graphs from engineering	claim
12	119	An improved linear bound on the number of perfect matchings in cubic graphs	claim
13	118	Partitions versus sets: A case of duality	claim
14	118	Partial covers of PG(n, q)	claim
15	116	A proof of Bressoud's conjecture related to the Rogers-Ramanujan identities	claim
16	114	An extension of the bivariate chromatic polynomial	claim
17	114	On distance-balanced graphs	claim
18	114	On the distance between the expressions of a permutation	claim
19	114	Rank-width and tree-width of H-minor-free graphs	claim
20	113	Counting paths in digraphs	claim
21	110	Problems from CGCS Luminy, May 2007	claim
22	110	A q-enumeration of alternating permutations	claim
23	109	Reversing a polyhedral surface by origami-deformation	claim
24	108	Shilla distance-regular graphs	claim
25	108	Modelling a Query Space Using Associations	claim
26	107	The flipping puzzle on a graph	claim
27	106	Maps admitting trialities but not dualities	claim
28	106	Small configurations in simple permutations	claim
29	105	Enumeration results for alternating tree families	claim
30	105	On the equivalence between real mutually unbiased bases and a certain class of association schemes	claim
31	104	Packing sets of patterns	claim
32	104	A short proof of a theorem of Bang and Koolen	claim
33	103	Descent polynomials for permutations with bounded drop size	claim
34	103	Exact solution of two classes of prudent polygons	claim
35	102	The edge-flipping group of a graph	claim
36	102	Perfect matchings with restricted intersection in cubic graphs	claim
37	102	Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms	claim
38	99	Minimum degree and density of binary sequences	claim
39	98	Facial colorings using Hall's Theorem	claim
40	98	Generalized incidence theorems, homogeneous forms and sum-product estimates in finite fields	claim
41	98	On the multiplication groups of semifields	claim
42	97	Some graphs related to the small Mathieu groups	claim
43	97	On graphs isomorphic to their neighbour and non-neighbour sets	claim
44	95	Isotopy problems for saddle surfaces	claim
45	95	Klazar trees and perfect matchings	claim
46	95	A natural bijection between permutations and a family of descending plane partitions	claim
47	94	Permutation codes	claim
48	94	Discrete piecewise linear functions	claim
49	94	The graphicahedron	claim
50	93	The generic rank of body-bar-and-hinge frameworks	claim
51	93	A note on antisymmetric flows in graphs	claim
52	93	Homomorphisms of random paths	claim
53	92	From quasisymmetric expansions to Schur expansions via a modified inverse Kostka matrix	claim
54	91	A tiling approach to eight identities of Rogers	claim
55	90	The Ramsey numbers for cycles versus wheels of even order	claim
56	90	Resolutions of three-rowed skew- and almost skew-shapes in characteristic zero	claim
57	90	The shape of unlabeled rooted random trees	claim
58	89	Forbidden subposets for fractional weak discrepancy at most k	claim
59	88	A linear equation for Minkowski sums of polytopes relatively in general position	claim
60	87	New bijective links on planar maps via orientations	claim
61	86	On a sphere that passes through n lattice points	claim
62	86	Some problems, I care most	claim
63	85	Problem section	claim
64	85	Locally subquadrangular hyperplanes in symplectic and Hermitian dual polar spaces	claim
65	85	On topological relaxations of chromatic conjectures	claim
66	84	Inversion of some series of free quasi-symmetric functions	claim
67	84	Contractibility and the Hadwiger Conjecture	claim
68	69	On loop identities that can be obtained by a nuclear identification	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers