Sciweavers

    EJC
    2006
    109views Information Technology» more  EJC 2006»
    Symplectic graphs and their automorphisms
    13 years 11 months ago
    Symplectic graphs and their automorphisms
    Download  math.suda.edu.cn
    The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...
    Zhongming Tang, Zhe-xian Wan
    claim paper
    Read More »
    EJC
    2006
    92views Information Technology» more  EJC 2006»
    Deza digraphs
    13 years 11 months ago
    Deza digraphs
    Download  ajc.maths.uq.edu.au
    As a generalization of Deza graphs, we introduce Deza digraphs and describe the basic theory of these graphs. We also prove the necessary and sufficient conditions when a weakly d...
    Kaishun Wang, Yan-Quan Feng
    claim paper
    Read More »
    EJC
    2006
    101views Information Technology» more  EJC 2006»
    Poset edge-labellings and left modularity
    13 years 11 months ago
    Poset edge-labellings and left modularity
    Download  www.facstaff.bucknell.edu
    It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1, 2, . . . , n ...
    Peter McNamara, Hugh Thomas
    claim paper
    Read More »
    EJC
    2006
    87views Information Technology» more  EJC 2006»
    Recouvrements Hamiltoniens de certains graphes
    13 years 11 months ago
    Recouvrements Hamiltoniens de certains graphes
    Download  www.ecp6.jussieu.fr
    Pierre Mazet
    claim paper
    Read More »
    EJC
    2006
    81views Information Technology» more  EJC 2006»
    Homomorphism bounded classes of graphs
    13 years 11 months ago
    Homomorphism bounded classes of graphs
    Download  www.math.carleton.ca
    A class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphism to H. We give a general necessary and sufficient condition for the existence of boun...
    Timothy Marshall, Reza Nasraser, Jaroslav Nesetril
    claim paper
    Read More »
    EJC
    2006
    95views Information Technology» more  EJC 2006»
    Group connectivity of graphs with diameter at most 2
    13 years 11 months ago
    Group connectivity of graphs with diameter at most 2
    Download  www.math.wvu.edu
    Hong-Jian Lai, Xiangjuan Yao
    claim paper
    Read More »
    EJC
    2006
    93views Information Technology» more  EJC 2006»
    The rank of connection matrices and the dimension of graph algebras
    13 years 11 months ago
    The rank of connection matrices and the dimension of graph algebras
    Download  research.microsoft.com
    László Lovász
    claim paper
    Read More »
    EJC
    2006
    77views Information Technology» more  EJC 2006»
    Invariant subspaces, duality, and covers of the Petersen graph
    13 years 11 months ago
    Invariant subspaces, duality, and covers of the Petersen graph
    Download  www.fmf.uni-lj.si
    A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
    Aleksander Malnic, Primoz Potocnik
    claim paper
    Read More »
    EJC
    2006
    99views Information Technology» more  EJC 2006»
    Hadamard ideals and Hadamard matrices with two circulant cores
    13 years 11 months ago
    Hadamard ideals and Hadamard matrices with two circulant cores
    Download  www.uow.edu.au
    We apply Computational Algebra methods to the construction of Hadamard matrices with two circulant cores, given by Fletcher, Gysin and Seberry. We introduce the concept of Hadamar...
    Ilias S. Kotsireas, Christos Koukouvinos, Jennifer...
    claim paper
    Read More »
    EJC
    2006
    124views Information Technology» more  EJC 2006»
    On the canonical metric representation, average distance, and partial Hamming graphs
    13 years 11 months ago
    On the canonical metric representation, average distance, and partial Hamming graphs
    Download  www.fmf.uni-lj.si
    Average distance of a graph is expressed in terms of its canonical metric representation. The equality can be modified to an inequality in such a way that it characterizes isometr...
    Sandi Klavzar
    claim paper
    Read More »
    « first‹ previous…5678910111213…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.